Java 1. Write code to define LinkedQueue and CircularArrayQueue classes which will implement QueueADT interface. Note that LinkedQueue and CircularArrayQueue will use linked structure and circular array structure, respectively, to define the following methods. (i) public void enqueue(T element); //Add an element at the rear of a queue (ii) public T dequeue(); //Remove and return the front element of the queue (iii) public T first(); //return the front element of the queue without removing it (iv) public boolean isEmpty(); //Return True if the queue is empty (v) public int size(); //Return the number of elements in the queue (vi) public String toString();//Print all the elements of the queue a. Create an object of LinkedQueue class and then add some names of your friends in the queue and perform some dequeue operations. At the end, check the queue size and print the entire queue. b. Create an object from CircularArrayQueue class and perform the same set of operations in step 1(a).
Java
1. Write code to define LinkedQueue<T> and CircularArrayQueue<T> classes which will
implement QueueADT<T> interface. Note that LinkedQueue<T> and CircularArrayQueue<T>
will use linked structure and circular array structure, respectively, to define the following
methods.
(i) public void enqueue(T element); //Add an element at the rear of a queue
(ii) public T dequeue(); //Remove and return the front element of the queue
(iii) public T first(); //return the front element of the queue without removing it
(iv) public boolean isEmpty(); //Return True if the queue is empty
(v) public int size(); //Return the number of elements in the queue
(vi) public String toString();//Print all the elements of the queue
a. Create an object of LinkedQueue<String> class and then add some names of your friends
in the queue and perform some dequeue operations. At the end, check the queue size
and print the entire queue.
b. Create an object from CircularArrayQueue<T> class and perform the same set of
operations in step 1(a).
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
