You may use the Java Library Queue class for Write a program to simulate checkout lines at a grocery store. There will be multiple queues, one for each checkout line. For this exercise, you may assume there are 5 checkout lines. You can use an array of queues to simulate the checkout lines. Use the following logic: 1. Generate 5 customers and enqueue them, one customer in each queue 2. Each new customers ready to check out choose the shortest line Customers enter the checkout queues randomly, and then each time a customer is generated that customer chooses the shortest line. If the lines are equal, then the first available line is chosen. Each transaction takes a random amount of time to complete. Print each action taken with Queue number, to the display. For your output show the queues with customers and activity, showing changes in each queue. You can capture all of the output at the end of the program running. Program should list actions that have been performed and Queue numbers. Be sure to limit your program in order to ensure that it does not run forever.

You may use the Java Library Queue class for Write a program to simulate checkout lines at a grocery store. There will be multiple queues, one for each checkout line. For this exercise, you may assume there are 5 checkout lines. You can use an array of queues to simulate the checkout lines. Use the following logic: 1. Generate 5 customers and enqueue them, one customer in each queue 2. Each new customers ready to check out choose the shortest line Customers enter the checkout queues randomly, and then each time a customer is generated that customer chooses the shortest line. If the lines are equal, then the first available line is chosen. Each transaction takes a random amount of time to complete. Print each action taken with Queue number, to the display. For your output show the queues with customers and activity, showing changes in each queue. You can capture all of the output at the end of the program running. Program should list actions that have been performed and Queue numbers. Be sure to limit your program in order to ensure that it does not run forever.

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 have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): (java code)
Java Code Dreamworld is known for his uniqueness and there are 2 different denomination coins in Dreamworld, 1-cent coins and 2 cents coins. They have two faces - heads and tails. Your job is to find a number of ways to make a line order for these coins using the so that their total value is N cents. The only condition in line planning is that the first coin in the plan should have heads at the top. All other coins can have tails or heads at the top. Take N = 2 as an example. Possible arrangements are (1H, 1H), (2H), (1H, 1T), where H is primary and T is the tail. So, there are 3 possible plans that cost 2 cents. Input: 1 3 Output: 8 00
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): J J J JJ J J KJ J K JJ J K KJ K J JJ K J KJ K K JJ K K KK J J JK J J KK J K JK J K KK K J JK K J KK K K JK K K K
Write a program to simulate checkout lines at a grocery store. There will be multiple queues, one for each check out line. For this exercise, you may assume there are 5 check out lines. You can use an array of queues to simulate the checkout lines. Customers enter the queue randomly to check out, and then choose the shortest line. If the lines are equal, then the first available line is chosen. Each transaction takes a random amount of time to complete. Print each action taken with Queue number, to the display. For your output show the queues with customers and activity, showing changes in each queue. You can capture all of the output at the end of the program running. Program should list actions that have been performed and Queue numbers. Be sure to limit your program in order to ensure that it does not run forever.
Write a code in Java Programming Your task is to simulate a coffee shop using the observer pattern (do not use the deprecate one). The coffee shop serves two types of coffee: espresso and cappuccino. The shop has two baristas, EspressoBarista and CappuccinoBarista. EspressoBarista generates random espresso orders between 1 and 3 every 2 seconds, while CappuccinoBarista generates random cappuccino orders between 1 and 3 every 3 seconds. The UML design diagram is shown below. Property ChangeListenerfac Observablenerfacto Coffeeshop HashMap Sting, integer> ingredients ExpresssCartate The CoffeeShop class holds the current stock of ingredients and the CoffeeShop constructor initializes the count for each ingredient. The required ingredients for each type of coffee are as follows: • Espresso: 1 shot of espresso, 1 ounce of milk Cappuccino: 1 shot of espresso, 2 ounces of milk, 1 ounce of foam If an order cannot be fulfilled because there are not enough ingredients, a warning message…
Write a program that draws a square fractal. Fractals are images that keep repeating their own image in ever-smaller versions. There exists numerous fractals and some fractals rely on computation of advanced mathematics. All fractals have a recursive quality and provide an ideal platform for practicing recursive concepts. You will note that from the four corners of the center rectangle, smaller rectangles are drawn and each rectangle in turn continues to draw three smaller rectangles until the rectangle is the size of one pixel. A CODE TEMPLATE & PICTURE OF OUTPUT IS ALREADY PROVIDED IN THE ATTACHED PICTURES Method drawSquare1 gets the ball rolling and draws a solid rectangle in the center of the screen. The initial rectangle needs to be 1/4 the size of the monitor. This explains why it is important to know the screen resolution and why this information is passed by parameter. Method drawSquare1 needs to make four method calls to draw each one of the four rectangles attached to…
Write a program that draws a square fractal. Fractals are images that keep repeating their own image in ever-smaller versions. There exists numerous fractals and some fractals rely on computation of advanced mathematics. All fractals have a recursive quality and provide an ideal platform for practicing recursive concepts. You will note that from the four corners of the center rectangle, smaller rectangles are drawn and each rectangle in turn continues to draw three smaller rectangles until the rectangle is the size of one pixel.
I need to write a java program to draw one of four recursively defined patterns.The patterns are in the attached picture. In each pattern a smaller square is drawn at each of the four corners of the next larger square. This pattern repeats again and again. It might repeat any number of times or levels. In the picture, the pattern is repeated four times or levels. If another level were asked for, then 192 very small squares would have to be drawn. The patterns differ in which squares are drawn on top of the others and thus may be hidden from view. The largest square, the one at level one, is drawn in the center of a square canvas and the length of its side is one half the length of the side of the canvas. The center of the next smaller square is always at the corner of the larger square. And the size of the next smaller square is determined by a fixed ratio R. If the smaller square has a side of length s and the next larger square has a side of length b, then R is the ratio b/s. In…
UOWD Library is asking you to write a Java program that manages all the items in the Library. The library has books, journals, and media (DVD for example). All items have a name, author(s), and year of publication. A journal also has a volume number, while a media has a type (audio/video/interactive). The user of your program should be able to add an item, delete an item, change information of an item, list all items in a specific category (book, journal, or media), and print all items (from all categories). A menu asks the user which operation s/he wants to perform. Important: make use of collections, inheritance, interfaces, and exception handling wherever appropriate.
Write a recursive Java method that calculates the sum of n positive integer numbers. The math function is: f(n) = 1 + 2 + 3 + … + n. Jack, Peter and John were exploring a tunnel which allows only one person to pass through. Jack entered the tunnel first, followed by Peter. John entered the tunnel the last. The tunnel has a dead end. So the team has to turn back and retrieve from the tunnel one by one. Write a Java program based on a suitable data structure to simulate this process.
You have a card on which the letter J is written on one side and K on the other. You want to see all of the possible ways the card will land if you drop it n times. Write a recursive method that prints each session of dropping the cardswith J's and K's in java?
Write a Java program (Hangman.java) to play the classic word game Hangman. In the game, a word is randomly selected from an array of possible words. Then, the user is prompted to guess letters in the word one at a time. When the user makes a correct guess, all instances of that letter in the word are shown. When all letters in the word have been guessed, the game ends and the score (number of missed guesses) is displayed. A user can play the game multiple times if they choose. Here is a sample run of a correct program (user input indicated by orange text):Enter a letter in word ******** > cEnter a letter in word c******* > rEnter a letter in word c******r > s s is not in the wordEnter a letter in word c******r > tEnter a letter in word c****t*r > mEnter a letter in word c*m**t*r > t t is already in the wordEnter a letter in word c*m**t*r > pEnter a letter in word c*mp*t*r > oEnter a letter in word comp*t*r > eEnter a letter in word comp*ter >…