Assignment

1. Implement a non-recursive reverse print of linked list using stack (see slides 67-68 of chapter 04) and the main function to test: You will need to finish the printReversed_nonrecursive method in ch04.LinkedStack2 class, and the ch04.UseStack2 is the main function to test.

2. Implement the Queue ADT using a circular linked list as discussed at the end of Section 5.6, also discussed during the class. You will finish the implementation of the ch05.queues.CircularLinkedUnbndQueue class that already provided partial implementation of the methods. You should complete enqueue (most part of this method is done), dequeue, isFull, isEmpty and toString method. Enhance main methods to test the functionality.

3. A "deque (double-ended queue)" is a data structure that allows you to push and pop from one end (tail) like a stack, and dequeue from the other end (front) like a queue. Create a LinkedListed-based unbounded Deque class that provide the following methods: push, pop, dequeue, and size(). You do not need to enlarge in the implementation. A main function should be created to test each of those methods.

You should download (git pull) the latest sources from github before you start your programming.

Your submission should two files with "_Assignment_3" as file name prefix:

1. A zipped file that contains the three Java source files, one for each of the questions. Source code should be compiled and executable. Please include comments in the sources. Grade will be given depending on the correctness, quality and clarity of the program.

2. A document that contains the screen shots of the executions of the three main programs.