
Queues are often used to simulate situations where people have to wait in line. One scenario we can simulate with a queue is the annual Single’s Night dance at the Elks Lodge. Men and women enter the lodge and stand in line. The dance floor is quite small and there is room for only three couples at a time. As there is room on the dance floor, dance partners are chosen by taking the first man and woman in line. These couples are taken out of the queue and the next set of men and women are moved to the front of the queue.
As this action takes place, the program announces the first set of dance partners and who the next people are in line. If there is not a complete couple, the next person in line is announced. If no one is left in line, this fact is displayed.
First, let’s look at the data we use for the simulation:
F Jennifer Ingram
M Frank Opitz
M Terrill Beckerman
M Mike Dahly
F Beata Lovelace
M Raymond Williams
F Shirley Yaw
M Don Gundolf
F Bernica Tackett
M David Durr
M Mike McMillan
F Nikki Feldman
We use a structure to represent each dancer. Two simple String class methods (Chars and Substring) are used to build a dancer

Step by stepSolved in 3 steps with 1 images

- Write a program using PHYTHON to create a grocery list where the user will add items one at a time until entering the word "STOP".At that point, the program will print out the items in the grocery list, 1 item per line.arrow_forwardJavaarrow_forwardWrite a program to understand customer waiting time. A list provides the number of customers that arrive every minute for 10 minutes. The program should output the length of the line at each minute, assuming one clerk serves each customer and takes 1 minute to complete service. If the input is 2 0 0 2 1 0 0 0 1 0, the output should be 2 1 0 2 2 1 0 0 1 0 (At minute 0, 2 customers arrived in line. At minute 1, 1 of those has been served, reducing the line to 1. At minute 2, that customer was served, reducing the line to 0). Output a space after each output integer, including the last (followed by newline). Hints: Every minute, if the lineLength wasn't 0, you can decrement lineLength because the clerk would have finished serving one customer. Every minute, if new customers arrived, just add them to lineLength for that minute.arrow_forward
- Java Algorithm Programming Question Implement the ADT queue by using a circular linked list. Recall that this list has only an external reference to its last note. Example Output: Create a queue: isEmpty () returns true Add to queue to get Joe Jess Jim Jill Jane Jerry isEmpty () returns false Testing getFront and dequeue: Joe is at the front of the queue. Joe is removed from the front of the queue. Jess is at the front of the queue. Jess is removed from the front of the queue. Jim is at the front of the queue. Jim is removed from the front of the queue. Jill is at the front of the queue. Jill is removed from the front of the queue. Jane is at the front of the queue. Jane is removed from the front of the queue. Jerry is at the front of the queue. Jerry is removed from the front of the queue. The queue should be empty: isEmpty() returns true Add to queue to get Joe Jess Jim Testing clear: isEmpty() returns true Add to queue to get Joe Jess Jim Joe is at the front of the queue. Joe is…arrow_forwardAsap do this? .arrow_forwardWhich of the following is the one that will most likely not be processed when a queue is terminated? What prompted the decision to remove it from general circulation?arrow_forward
- Given the value of queue(Q), execute the given code and answer the questions. Assume that Q iscircular with the size limit of 6. Thanks!!!arrow_forwardPlease help me with this! During the Battle at the Alamo, a the defenders suddenly discovered they are surrounded by an overwhelming force. There is absolutely no hope for victory without reinforcements, and David Crockett's horse is the only horse available that can be used to escape and summon help. The defenders agree to a pact to determine which of them is to go for help. The defenders form a queue and they pick a number from a hat. Beginning with the first officer in the queue, they begin to count. As each defender counts off, he moves to the end of the queue. When the count reaches the number that was picked, that defender is removed from the queue, and the count begins again with the next man. Once an defender is removed from the queue, he is no longer counted. The last defender that remains in the queue is the one that rides away on the horse to summon help. —————————— The countOff() method displays the name of each officer removed from the queue, in the order in which they…arrow_forwardimport java.util.*;import java.io.*; public class HuffmanCode { private Queue<HuffmanNode> queue; private HuffmanNode overallRoot; public HuffmanCode(int[] frequencies) { queue = new PriorityQueue<HuffmanNode>(); for (int i = 0; i < frequencies.length; i++) { if (frequencies[i] > 0) { HuffmanNode node = new HuffmanNode(frequencies[i]); node.ascii = i; queue.add(node); } } overallRoot = buildTree(); } public HuffmanCode(Scanner input) { overallRoot = new HuffmanNode(-1); while (input.hasNext()) { int asciiValue = Integer.parseInt(input.nextLine()); String code = input.nextLine(); overallRoot =…arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





