You have to either memorize who was there when you entered, or carefully keep track of who arrived after you did. barber shops and still is in the ones that I patronize. Similarly, a queue data structure follows a 'First In First Out' policy (as in the case of a normal queue when we stand in line at the counter), where the first element is pushed into the queue or 'Enqueued' and the same element when it has to be removed from the queue is 'Dequeued'. The Problem You will write a program that reads in information about customers: which line they go to the back of (1 through 12), at what time (in seconds) they enter that line, and the number of items they have, and determines at what time each customer will check out. If people are not arranged in order of arrival and there is no numbering system in place, then it is necessary to remember who was ahead of you and who arrived later.
People wait in grocery and department stores for their turn to pay for their items. That sounds abstract, but everyday people encounter queue lines all the time. This system is usually obvious and you just have to grab the next number. Simply, a queue line is an ordered group of people waiting for their turn to do something. There is a virtual queue but not a physical one. In the U.S., some places give out numbers upon arrival, or have machines that say "Take a number." People are served in numerical order and there might even be a display that shows the number currently being served.
If people are just scattered around but waiting for service on a "first-come, first-served" basis, then there really isn't a queue (except to operations researchers).
0 kommentar(er)
