. 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

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question

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).  

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Types of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education