Array Version Assignment
Overview
In lecture, you've learned the array implementation of several linear data structures. The ArrayList was fully coded but the array version of the stack, queue, and deque were discussed only in general terms, no code. Also, the array version of each of these data structures discussed in class had a fixed amount of storage, the array data member could not be reassigned an array which is larger or smaller than the current array. But, a dynamic version of the ArrayList was covered as well. Coding the dynamic array versions of the stack, queue, and deque are important to strengthen your understanding of the inner workings of these data structures.
Design
You will write the implementation for the DynamicArrayStack, DynamicArrayQueue, and DynamicArrayDeque classes. Download the files DynamicArrayStack.java, DynamicArrayQueue.java, DynamicArrayDeque.java Stack.java, Queue.java, and Deque.java needed for the assignment.
You will write code for all the methods of the DynamicArrayStack.java, DynamicArrayQueue.java, and DynamicArrayDeque.java classes. You cannot add any additional data members to each class and you cannot modify the code for the constructors of each class. For the "Dynamic" aspect of this assignment, you can use the appropriate code from the DynamicArrayList.java class. You do not need to create any other classes for this assignment at all!
You do not need to write any other code for the assignment but you will need to thoroughly test your code implementation for the three classes.
Attachment:- Java files.rar