. 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
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
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).
If your implementation is correct, you should get the same results from step 1(a) and 1(b).
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
