Part 3: First-In-First-Out (FIFO) Create a program that will simulate a First-In-First-Out process in a drive through take-out service. The program will display the following option (see table 1) for the user to choose. The program will continue to iterate select an option until the user selected the option q (Quit) to end the run time. Table 1: Option Function The program will ask the user to input a Plate Number and a list of Orders (en) Enter Add the inputted data at the queue (meaning, at end of the array) The program will display the least recently added data (plate number and the list of orders). - Display 'No Queue' if the array is empty. The program will display all plate numbers in queue. Display 'No Queue' if the array is empty. Remove the least recently added data (meaning the first data in the array) The program will display 'Plate Removed' (wn) Who's Next (sa) Show All (ex) Exit Display 'Nothing to Exit’if the array is empty. End the runtime/Exit. (q) Quit Requirements : • Your Program should contain two (2) or more methods. • You can only use a Java Array []. Using of Java Collection is not allowed. • Display an error message if any possible errors.
Part 3: First-In-First-Out (FIFO) Create a program that will simulate a First-In-First-Out process in a drive through take-out service. The program will display the following option (see table 1) for the user to choose. The program will continue to iterate select an option until the user selected the option q (Quit) to end the run time. Table 1: Option Function The program will ask the user to input a Plate Number and a list of Orders (en) Enter Add the inputted data at the queue (meaning, at end of the array) The program will display the least recently added data (plate number and the list of orders). - Display 'No Queue' if the array is empty. The program will display all plate numbers in queue. Display 'No Queue' if the array is empty. Remove the least recently added data (meaning the first data in the array) The program will display 'Plate Removed' (wn) Who's Next (sa) Show All (ex) Exit Display 'Nothing to Exit’if the array is empty. End the runtime/Exit. (q) Quit Requirements : • Your Program should contain two (2) or more methods. • You can only use a Java Array []. Using of Java Collection is not allowed. • Display an error message if any possible errors.
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
Related questions
Question
IT IS COMPLETE, PLEASE HELP EXPERTS
![Part 3: First-In-First-Out (FIFO)
Create a program that will simulate a First-In-First-Out process in a
drive through take-out service.
The program will display the following option (see table 1) for the user
to choose. The program will continue to iterate select an option until the
user selected the option q (Quit) to end the run time.
Table 1:
Option
Function
The program will ask the user to input a
Plate Number and a list of Orders
(en) Enter
Add the inputted data at the queue (meaning,
at end of the array)
The program will display the least recently
added data (plate number and the list of
orders).
Display 'No Queue' if the array is empty.
The program will display all plate numbers
in queue.
Display 'No Queue' if the array is empty.
Remove the least recently added data
(meaning the first data in the array)
The program will display 'Plate Removed'
(wn) Who's Next
(sa) Show Al1
(ex) Exit
Display 'Nothing to Exit' if the array is
(q) Quit
empty.
End the runt ime/Exit.
Requirements:
• Your Program should contain two (2) or more methods.
You can only use a Java Array []. Using of Java Collection is not
allowed.
• Display an error message if any possible errors.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb4331357-0cd0-4ba5-9f9f-f9e07da662bf%2Fa1fc2aa8-8e95-4652-b48c-e3fcac11c0fe%2F1yruenl_processed.png&w=3840&q=75)
Transcribed Image Text:Part 3: First-In-First-Out (FIFO)
Create a program that will simulate a First-In-First-Out process in a
drive through take-out service.
The program will display the following option (see table 1) for the user
to choose. The program will continue to iterate select an option until the
user selected the option q (Quit) to end the run time.
Table 1:
Option
Function
The program will ask the user to input a
Plate Number and a list of Orders
(en) Enter
Add the inputted data at the queue (meaning,
at end of the array)
The program will display the least recently
added data (plate number and the list of
orders).
Display 'No Queue' if the array is empty.
The program will display all plate numbers
in queue.
Display 'No Queue' if the array is empty.
Remove the least recently added data
(meaning the first data in the array)
The program will display 'Plate Removed'
(wn) Who's Next
(sa) Show Al1
(ex) Exit
Display 'Nothing to Exit' if the array is
(q) Quit
empty.
End the runt ime/Exit.
Requirements:
• Your Program should contain two (2) or more methods.
You can only use a Java Array []. Using of Java Collection is not
allowed.
• Display an error message if any possible errors.
Transcribed Image Text:Sample Output:
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
(q)
Quit
>> en
Enter Plate Number: ABc-897
Enter Orders: Chicken Joy, Big Boy Burger, Ice Coffee
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
(q) Quit
>> en
Enter Plate Number: zzx-9388
Enter Orders: Dinuguan, Shang-Hai, Sky Flakes, Orange Juice
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
Quit
(q)
>> wn
ABC-897 (Chicken Joy, Big Boy Burger, Ice Coffee)
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
Quit
(q)
>> ex
Plate Removed
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(еx) Еxie
Quit
(g)
>> en
Enter Plate Number: zzx-1001
Enter Orders: Chocolate Drink
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
Quit
(q)
>> wn
22x-9388 (Dinuguan, Shang-Hai, Sky Flakes, Orange Juice)
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(еx) Еxit
Quit
(q)
>> sa
1. zzx-9388 (Dinuguan, Shang-Hai, Sky Flakes, Orange Juice)
2. zzx-1001 (Chocolate Drink)
Select an Option
(en) Enter
(wn) Who's Next
(sa) Show All
(ex) Exit
(q)
Quit
bes
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 6 images
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education