Exercise Sheet 9: I'd be lost without a Map

Implement the singly linked representation of the Simplist ADT discussed in the DAT Notes. As usual, write a test program to ensure it works according to the specification.
The DAT Notes discuss an implementation of a Map ADT based on a Linked List. Some example code for the image method is given in the notes. Write a class MapLinked that completes the ADT. Your class should be based on your ListLinked class (you may try DAT.ListLinked if you are uncertain your ListLinked class is correct) and must implement the interface DAT.Map which can be found in the DAT package.
DAT Spot Check
You should submit your MapLinked class for checking. This will be the last assignment for submission to datlab.
[2 lab marks]



	Copyright © 2006 Cara MacNish, School of Computer Science & Software Engineering, UWA.



	Exercise Sheet 9: I'd be lost without a Map Implement the singly linked representation of the Simplist ADT discussed in the DAT Notes. As usual, write a test program to ensure it works according to the specification. The DAT Notes discuss an implementation of a Map ADT based on a Linked List. Some example code for the image method is given in the notes. Write a class `MapLinked` that completes the ADT. Your class should be based on your `ListLinked` class (you may try `DAT.ListLinked` if you are uncertain your `ListLinked` class is correct) and must implement the interface `DAT.Map` which can be found in the DAT package. DAT Spot Check You should submit your `MapLinked` class for checking. This will be the last assignment for submission to `datlab`. [2 lab marks]