Description: The static (circular) queue should be implemented as a class named StaticCircularQueue With
a maximum of 100 integer elements,
The Dynamic queue should be implemented as a class named DynamicQueue,
The Dynamic queue must not be restricted to a particular size and should be implemented
Using inheritance the SinglyLinkedList class previously studied in class,
Five operations should be provided for each implementation, these are: enQueue, DeQueue,
front, size, and isEmpty,
Main method with relevant operations for testing the above two classes, and
The test results.
To Search:
File list (Check if you may need any files):
DataStructure\.classpath
.............\.project
.............\bin\DoublyLinkedList$Node.class
.............\...\DoublyLinkedList.class
.............\...\DynamicQueue.class
.............\...\DynamicStack.class
.............\...\MainClass.class
.............\...\SinglyLinkedList$Node.class
.............\...\SinglyLinkedList.class
.............\...\StaticCircularQueue.class
.............\...\StaticStack.class
.............\src\DoublyLinkedList.java
.............\...\DynamicQueue.java
.............\...\DynamicStack.java
.............\...\MainClass.java
.............\...\SinglyLinkedList.java
.............\...\StaticCircularQueue.java
.............\...\StaticStack.java
.............\bin
.............\src
DataStructure
Download