Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1 Enter First Name: George Enter Last Name: Smith 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue - Stop Enter your choice: 1 Enter First Name: Eve Enter Last Name: Connor 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1. Enter First Name: Elsa Enter Last Name: George 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 1. Enter First Name: Linal Enter Last Name: Wanner 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 7 George Smith, 1808 Eve Connor, 1809 Elsa George, 1810 Lina Wanner, 1811 Continued... 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue - Stop Enter your choice: 4. Empty? false 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: George George Smith 1808 Elsa George 1810 In the queue? true 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6. Enter first or last name: Samanthal In the queue? false 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue - Stop Enter your choice: 3 George Smith, 1808 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 0 Buo

1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1 Enter First Name: George Enter Last Name: Smith 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue - Stop Enter your choice: 1 Enter First Name: Eve Enter Last Name: Connor 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1. Enter First Name: Elsa Enter Last Name: George 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 1. Enter First Name: Linal Enter Last Name: Wanner 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 7 George Smith, 1808 Eve Connor, 1809 Elsa George, 1810 Lina Wanner, 1811 Continued... 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue - Stop Enter your choice: 4. Empty? false 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: George George Smith 1808 Elsa George 1810 In the queue? true 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6. Enter first or last name: Samanthal In the queue? false 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue - Stop Enter your choice: 3 George Smith, 1808 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 0 Buo

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
1- Insert. 2- Remove 3- Who is next? 4- Check if empty. 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 1. Enter First Name: George Enter Last Name: Smith 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 0- Stop Enter your choice: 1 Enter First Name: Eve Enter Last Name: Connor 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue e-Stop Enter your choice: 1 Enter First Name: Elsa Enter Last Name: George 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1 Enter First Name: Lina Enter Last Name: Wanner 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue - Stop Enter your choice: 7 George Smith, 1808 Eve Connor, 1809 Elsa George, 1810 Lina Wanner, 1811 Continued... 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 4 Empty? false 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: George George Smith 1808 Elsa George 1810 In the queue? true 1- Insert. 2- Remove 3- Who is next? 4- Check if empty. 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: Samanthal In the queue? false. 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue 0- Stop Enter your choice: 3 George Smith, 1808 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue 0- Stop Enter your choice: 0 Bye
Transcribed Image Text:1- Insert. 2- Remove 3- Who is next? 4- Check if empty. 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 1. Enter First Name: George Enter Last Name: Smith 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 0- Stop Enter your choice: 1 Enter First Name: Eve Enter Last Name: Connor 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains. 7- display the queue e-Stop Enter your choice: 1 Enter First Name: Elsa Enter Last Name: George 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue - Stop Enter your choice: 1 Enter First Name: Lina Enter Last Name: Wanner 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue - Stop Enter your choice: 7 George Smith, 1808 Eve Connor, 1809 Elsa George, 1810 Lina Wanner, 1811 Continued... 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains. 7- display the queue 0- Stop Enter your choice: 4 Empty? false 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: George George Smith 1808 Elsa George 1810 In the queue? true 1- Insert. 2- Remove 3- Who is next? 4- Check if empty. 5- Check the size 6- Check if contains 7- display the queue 8- Stop Enter your choice: 6 Enter first or last name: Samanthal In the queue? false. 1- Insert 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue 0- Stop Enter your choice: 3 George Smith, 1808 1- Insert. 2- Remove 3- Who is next? 4- Check if empty 5- Check the size. 6- Check if contains 7- display the queue 0- Stop Enter your choice: 0 Bye
Create a class named CustomerITD, the tests in this class will not be hard coded, instead, the main method creates a LinkedQueue and give the user a list of operations they can perform on the linked queue like, enqueue, dequeue, peekFront, contains, display, size, isEmpty and display. The serviceNumber for the first customer added to the queue should be a 4-digit random number and increments for each new customer. Test your ITD by adding, removing and performing other operations on the Linked Queue. On the next page, I'm showing an example of the ITD usage. This is just an example of how the ITD should look like. Remember, the Customer ITD is a separate class you have to create, you are free to add any methods to that class in order to create the ITD.
Transcribed Image Text:Create a class named CustomerITD, the tests in this class will not be hard coded, instead, the main method creates a LinkedQueue and give the user a list of operations they can perform on the linked queue like, enqueue, dequeue, peekFront, contains, display, size, isEmpty and display. The serviceNumber for the first customer added to the queue should be a 4-digit random number and increments for each new customer. Test your ITD by adding, removing and performing other operations on the Linked Queue. On the next page, I'm showing an example of the ITD usage. This is just an example of how the ITD should look like. Remember, the Customer ITD is a separate class you have to create, you are free to add any methods to that class in order to create the ITD.
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Avoiding deadlock
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
SEE MORE TEXTBOOKS