Some skeletal program code for this application is shown in Figure 1 , which follows.
At the minimum, your program is to perform these tasks:
• Declare and populate an array or array list that will hold the names of the
customers in line to be serviced.
• Display the elements in the queue via a message dialog box.
• Add a new customer to the rear of the queue.
• Remove an existing customer from the front of the queue.
• Check if all the customers have been serviced.
Then compile and run your program, observe the output and then modify the program.
Information About This Project
Typical queue operations include:
Method Description / Operation
enqueue() adds an item to the rear of the queue
dequeue() removes an item from the front of the queue
isEmpty() determines if the queue is empty
Example ( Queue )
Some examples of a queue data structure include a queue of customers at a retail store point of service, packets of data in an electronic transmission and being place on hold when awaiting to place a telephone order to the local pizza parlor.
