Do these structures hold a fixed size set of items (i.e., static), or can they grow at runtime?

Build three classes that conform to the following interfaces. Use arrays in creating your classes (e.g., do not use the built-in ArrayList class when creating the ArrayList-like interface). Extend the sample driver below to completely test the FIFO nature of a Queue, the LIFO nature of a stack and the arbitrary inserts and removes in an ArrayList-like structure.
Sample Driver:
ArrayList-like Interface (call this class ArrayList):
void insert(Object, int index): Add the object at the specified index, shifting other elements over as needed.
Object remove(int index): Remove and return the object at the specified index. (This should behave like the corresponding method in Java’s built-in ArrayList class; see Savitch’s description in Display 14.1.)
int size()
String toString()
boolean isEmpty()
int indexOf(Object): Returns -1 if not found
boolean equals(ArrayList): Compare sizes and elements in the data structure.check the sizes of the two objects first. If they’re different sizes, then you can return false. If they’re the same size, you should walk down the lists, calling equals() on each of the respective objects.
Note: some people try to just compare the toString output of the two objects (e.g. “return other.toString().equals(this.toString()); ” ) Never do that. It’s bad style and it’s not always guaranteed to come up with the right answer (sometimes a toString won’t give all the info for a particular object.)
Object get(int index): Returns the object at index specified.
Stack Interface (LIFO)
void push(Object)
Object pop()
int size()
String toString()
boolean isEmpty()
boolean equals(Stack)
Queue Interface (FIFO)
void enqueue(Object)
Object dequeue()
int size()
String toString()
boolean isEmpty()
boolean equals(Queue)
Hints and Notes
Deliverables: You should turn in one .zip file, and inside of that will be four .java files, three are for your classes and the fourth is your test harness (driver). Your data structure classes have to be named ArrayList, Stack, and Queue and your driver named the same as the sample driver. If you submit multiple versions, Canvas will rename your files with a “-1”, etc. suffix, but that’s okay. We can handle that change. But the base name of your class has to be as described. (NOTE: because your array-like class is called ArrayList, you DON’T want to import Java’s actual built-in ArrayList class. So DON’T call “import java.util.ArrayList;” or “import java.util.*;” Otherwise there will be some namespace clashes.) Also remember that the file name has to be the same as the class name. (So, for example, contains the class called Stack.)
You should practice building drivers and even more advanced testing harnesses yourself. The above driver is merely a starting point that you can use to initially exercise your code. In lecture, we will talk about what a testing harness should do. For this assignment, you can just display the results of your test to screen. Once we’ve gone through exception handling, you will have all the skills needed to write the harness the way I described in class.
A reminder that Stacks should be LIFO, queues should be FIFO, and ArrayLists can add and remove in arbitrary order.
The data structures should hold objects of class Object.
Your code should not depend on absolute path specifications or any other environment-specific specifications. We will take off 3 points from any submission that has such a specification. (To those using Eclipse, this is a particularly easy mistake to make because Eclipse will often add in a package statement automatically.) The grader should not have to change your code to run it on his/her machine. If you’re not sure how to make your submission non-environment-specific, please see me. The program should not ask for user input from the console.
The toString methods should show the contents of the data structure in a “natural” ordering. Assuming the method writes data structure elements from left to right, for a stack, this starts from top on down, for a queue, this is from front to back, and for an ArrayList, this is from first index to the last index.
Q: The list of methods I’m supposed to write seems to be missing methods I need in order for me to actually create and use an instance of the class. For instance, my ArrayList-like class, if it does not have an add or append method, cannot be used for anything. Can I create additional methods? A: Yes, you should create any methods you believe necessary in order to make the class work. The list of methods given above are just the ones we’re looking for to grade.
Q: Do these structures hold a fixed size set of items (i.e., static), or can they grow at runtime? A: Your software should be able to automatically resize your array once capacity is reached, and may be tested beyond 100 elements. Remember that stacks, queues, etc. are (in the abstract) infinite capacity data structures.
Q: What is FIFO and LIFO? A: Good question.
Q: How will you test this code? A: Tests may use the same strategies and techniques shown to you in the first few HWs, but more complete.
Q: Are comments (file headers, method headers, inline comments) important? A: Comments are now worth almost 2 letter grades, so I’d include them.
Q: I think there is a way to relate these classes via inheritance. Should I do this? A: We’ll cover this later in the quarter; you should use no inheritance for this assignment.
Q: If I’m not to use inheritance, then how can I code the equals methods in such a way that it can accept input of class Object? A: We’ll see later on (pp. 465-471 to be precise) how to utilize inheritance principles to properly write the equals method. For now, while you are to accept anything of class Object as input, you don’t have to check what the input types are. That is to say, you don’t have to return false if the input is a different type than the type of the ArrayList, etc. class. To enable the comparison, convert the input into ArrayList (or whatever class is appropriate) using a cast. For example: ArrayList al = (ArrayList) input; // from now on, compare using ‘al’

Leave a Reply

Your email address will not be published. Required fields are marked *