Data structure & alogrithum java program  Create a corresponding DRIVER/Tester class that performs the following steps: 1. Create an instance of this deque containing a list of string data-type 2. Check if deque is empty 3. Display who is in the front and who is in the back 4. Add 6 elements to this queue containing a list of people's First and Last Names (your friends, family, Tv Show characters, sports) by adding some to the front and some to the back 5. Check if the queue is empty 6. Display who is in the front and who is in the back 7. Remove the person on the front and the person in the back 8. Display who is in the front and who is in the back 9. Clear all elements in the queue 10. Check if the queue is emoty 11. Display who is in the front and who is in the back

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

Data structure & alogrithum java program 

Create a corresponding DRIVER/Tester class that performs the following steps:

1. Create an instance of this deque containing a list of string data-type
2. Check if deque is empty
3. Display who is in the front and who is in the back
4. Add 6 elements to this queue containing a list of people's First and Last Names (your friends, family, Tv Show characters, sports) by adding some to the front and some to the back
5. Check if the queue is empty
6. Display who is in the front and who is in the back
7. Remove the person on the front and the person in the back
8. Display who is in the front and who is in the back
9. Clear all elements in the queue
10. Check if the queue is emoty
11. Display who is in the front and who is in the back

 
 
DLNode<T>
-data : T
-next: DLNode<T>
-previous DLNode<T>
+DLNode(dataPortion T)
+DLNode(dataPortion: T, nextNode: DLNode<T>, previousNode : DLNode<T>)
+getData() T
+setData(newData : T): void
+getNextNode() DLNode<T>
+setNextNode(nextNode DLNode<T>) void
+getPreviousNode() DLNode<T>
+setPreviousNode(previousNode : DLNode<T>).
Transcribed Image Text:DLNode<T> -data : T -next: DLNode<T> -previous DLNode<T> +DLNode(dataPortion T) +DLNode(dataPortion: T, nextNode: DLNode<T>, previousNode : DLNode<T>) +getData() T +setData(newData : T): void +getNextNode() DLNode<T> +setNextNode(nextNode DLNode<T>) void +getPreviousNode() DLNode<T> +setPreviousNode(previousNode : DLNode<T>).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 6 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY