COSC 311 WINTER 2016  Homework 1/28/2016

Due 1/26/2016

(1) Write Java code to implement and test the circular queue pseudo-code given
in http://emunix.emich.edu/~haynes/CommonCourseMaterial/311/circularQueue.txt
The queue must be a 1D array (not ArrayList, not LinkedList).
You may assume the data type of the queue elements is int.

(2) There are two classes: Driver and CircularQueue
The CircularQueue class must contain setter(s), getter(s), toString(), as well
as whatever is indicated by the pseudo-code.

(3) Give a screen shot showing execution with the following operations in order:

create a CircularQueue size 4
insert(1)
insert(2)

insert(3)
insert(4)
printQueue()

delete()
delete()
delete()

delete()
insert(5)
printQueue()

(4) Give UML class diagram.
You must include method return types and parameter types, as well as data types.