In a bank, customers wait in a queue (q0) for their turn to complete a transaction. Customers who come first areserved first. At a certain point when there are lots of customers waiting, a decision is taken to split the queueelements into two empty queues q1 and q2. The customers are split based on the alphabetical order of their firstnames. Customers with first name starting A-H are added to q1 while the others (first name starting I-Z) areadded to q2.In an application, write a method named splitQueue (in an application) that accepts as parameters 3 queues, theoriginal queue (q0) and two empty queues (q1 and q2) to be filled as described above. Write also a mainmethod in which you read the first names of customers from the user, fill them into q0 and call the methodsplitQueue to split q0 elements into q1 and q2. After the split display the elements of q1 first then those of q2.The header of the method is:public static void splitQueue ( Queue q0, Queue q1, Queue q2)Note: Make sure you do the necessary modifications to allow the queue to store Strings (first names).

Answered: Queue (in an application) that accepts…

Queue (in an application) that accepts as parame a1 and q2) to be filled as described above. Write customers from the user, fill them into q0 and ca

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

Similar questions

You want to buy a ticket for a well-known concert which is happening in your city. But the number of tickets available is limited. Hence the sponsors of the concert decided to sell tickets to customers based on some priority. A queue is maintained for buying the tickets and every person is attached with a priority (an integer, 1 being the lowest priority). The tickets are sold in the following manner - 1. The first person (pi) in the queue requests for the ticket. 2. If there is another person present in the queue who has higher priority than pi, then ask pi to move at end of the queue without giving him the ticket. 3. Otherwise, give him the ticket (and don't make him stand in queue again). Giving a ticket to a person takes exactly 1 minute and it takes no time for removing and adding a person to the queue. And you can assume that no new person joins the queue. Given a list of priorities of N persons standing in the queue and the index of your priority (indexing starts from 0). Find…
You are approached by an online delivery shipping firm, which asks you to write them code for some tasks they face. The products they ship have some attributes, which are as follows: Product ID (Integer) [This is unique for every product] Product label (String) Manufacturer (String) All strings are of maximum length 100 and contain only alphanumeric characters. The products arrive one by one, and a common queue is maintained for all of them. Also, there is a fixed set of manufacturers the company has a tie-up with: Nike Adidas Reebok Puma Diadora You are to automate some repetitive tasks. The tasks are as follows: 1) Add a new product to the queue. 2) Deliver the next product of the queue and print the product information delivered. 3) Query how many products of a given manufacturer is currently present in the queue. 4) Query how many products of a given manufacturer has been shipped already. Initially, the product queue is empty. It is also guaranteed that when new products are…
In Python Programming language USING AVL TREE Building an automatic appointment reservation system for a very busy heart surgeon in the city. The system is going to work as follows: The patient requests for an appointment time. The system looks through the list of appointments and if there are no appointments scheduled within 10 minutes either way of the requested time, then that appointment is added to the list of appointments along with the patient ID. Otherwise, the patient is given the next available time automatically that is not within 10 minutes of any other scheduled appointment. At the appointed time, the appointment is marked as serviced and deleted from the list of appointments. You must use an AVL Tree to implement this appointment system. The reservation system should run as follows: It should run for a total of 12*25*60 minutes. At each time instant, there is a 10% probability that a new request comes in. If a new request comes in, generate a random number between the…
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 IngramM Frank OpitzM Terrill BeckermanM Mike DahlyF Beata LovelaceM Raymond WilliamsF Shirley YawM Don GundolfF Bernica TackettM David DurrM Mike McMillanF Nikki…
Hospital XX has a program to manage patient queues with the following criteria:1. Queue priority is set based on the patient’s condition in the following order: Critical > Serious > Fair > Good2. If the patient has the same condition then First In First Served3. There are two types of events: ADD and CALL4. ADD to insert patient to the queue5. CALL to move the patient into the room based on condition:a. If patient in “Critical” Condition then move to Emergency Roomb. If patient in “Serious” Condition then move to the Examination Roomc. If patient in “Fair” or “Good” Condition move to the Consultation RoomTry implementing Double Linked List into the Hospital XX program using CFORMAT INPUTThe first line contains an integer N events. Each event containsthree variables String C1, String C2, String C3. String C1 with format “C1 C2 C3” FORMAT OUTPUTIf “CALL” is triggered then1. If patient in “Critical” Condition then the output format will be : “C2 is in the Emergency Room”2. If…
Customers at a motor vehicle licence renewal office is assigned a number on arrival, and customers are served in the order of their allocated numbers.A Priority Queue is selected as the data structure to maintain the waiting list. Why?
A company "XYZ" is manufacturing two types of grinders, called X and Y. The grinders X and Y are kept in a row. Write an algorithm using the queue data structure to replace all grinders X in the row with grinder Y. Illustrate your algorithm for any sample input.
C/C++ Using linked lists implement an amusement park reservation system. The system allows a person to make a reservation for a specific date. A person can change the reservation date or even cancel his booking anytime. The system puts all reservations in a queue. The park will allow only certain number of persons on any given day in order the reservation was made. For each day the system will print out persons allowed to visit the park. For sake of simplicity, dates are being confined to 15th to 30th. The system should ask the user to enter code for different operations. It reads all data from the datafile amusement.dat. The first integer on datafile indicates limit of persons allowed on any day. i)code 1: make reservation, system expects date followed by name (within 20 characters) and makes reservation. If number of bookings exceeds allowed number, then system prints SORRY, QUOTA OVER and moves over to read next code. ii)code 2: change date of reservation, system expects old date,…
in the array based queue, if the rear = front then Select one: a. the queue is empty b. the queue must have many items C. the queue is full d. the queue has one item
Q2: Ginormous Campus There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CSC108 lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Filename Your filename for this question must be q2.py. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes,…
PLEASE USE C/C++.DONOT USE PYTHON Using linked lists implement an amusement park reservation system. The system allows a person to make a reservation for a specific date. A person can change the reservation date or even cancel his booking anytime. The system puts all reservations in a queue. The park will allow only certain number of persons on any given day in order the reservation was made. For each day the system will print out persons allowed to visit the park. For sake of simplicity, dates are being confined to 15th to 30th. The system should ask the user to enter code for different operations. It reads all data from the datafile amusement.dat. The first integer on datafile indicates limit of persons allowed on any day. code 1: make reservation, system expects date followed by name (within 20 characters) and makes reservation. If number of bookings exceeds allowed number, then system prints SORRY, QUOTA OVER and moves over to read next code. code 2: change date of…
Instrument FrequencyCounter to use Stopwatch and StdDraw to make a plot where the x-axis is the number of calls on get() or put() and the y-axis is the total running time, with a point plotted of the cumulative time after each call. Run your program for Tale of Two Cities using SequentialSearchST and again using BinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.