<p>One classic type of problem is handling communications - especially asynchronous communications from multiple sources. That may be a bit much in an elementary course if you want to mostly avoid race conditions. </p>

<p>But a problem with a single producer and a single consumer can also be informative, though it doesn't completely avoid race conditions. Have some simple process produce some data (an object, say) and queue it. Have another process dequeue objects when available and handle them. The consumer can busy-wait on the queue in simple cases. </p>

<p>It is most informative when the producer is sometimes a bit faster than the consumer so that the queue normally has something to be processed. But other problems occur if it is consistently faster, of course. </p>

<p>You can also use such things as an introduction to the ideas around race conditions, dropped data, etc, since anomalies will eventually occur without some form of synchronization. </p>

<p>Such a simple setup that introduces a much deeper set of ideas is called a <em>Toy Box</em> in the Pedagogical Patterns community. The application isn't truly realistic, but gets students thinking about deeper issues that will be covered later in their education. </p>

CC BY-SA 4.0
2019-05-21T17:23:13.237Z
2019-05-21T17:23:13.237Z
Buffy
<p>Here's a real-life example from a previous job: the <a href="https://en.wikipedia.org/wiki/Federal_Aviation_Administration" rel="nofollow noreferrer">Federal Aviation Administration</a> uses queueing models for a ton of their algorithms, from scheduling flight departures to rerouting flights because of severe weather.</p>

<p>Googling "<a href="https://www.google.com/search?q=faa+queueing+models" rel="nofollow noreferrer">FAA queueing models</a>" will return a ton of research papers that are pretty interesting, although probably too advanced for an introductory class. You could simplify the exercise into a simulation of an airport.</p>

<p>Another real-life example that I think about often are <a href="https://en.wikipedia.org/wiki/Supermarket" rel="nofollow noreferrer">supermarket</a> lines. Maybe make an assignment out of this question: what's the most efficient way to get X people through Y checkout lanes?</p>

CC BY-SA 4.0
2019-06-04T01:17:19.600Z
You have to specify whether you want minimal average wait times, minimal maximum wait times, or minimum overall time to process. They may all net you slightly different results.
Ben I.
CC BY-SA 4.0
2019-06-04T01:20:48.357Z
@BenI. True. I think that's good fodder for classroom discussion. :p
Kevin Workman
CC BY-SA 4.0
2019-06-04T00:59:48.787Z
2019-06-04T00:59:48.787Z
Kevin Workman
<p>You can do level-order traversal of a binary tree using a queue.  </p>

CC BY-SA 4.0
2019-05-23T14:56:35.360Z
2019-05-23T14:56:35.360Z
ncmathsadist
<p>The two killer applications that immediate come to mind are event handlers and discrete event simulation.  The use of queues in event handling is a little more complicated, as the process also involves interrupts (hardware and/or software) and events can be deleted from the queue before they are ever handled (for example, GUI events that become redundant when the second one happens before the first is handled), but the core mechanism is a queue.  For example,</p>

<p><a href="https://softwareengineering.stackexchange.com/questions/363397/how-does-an-event-listener-work">StackExchange:  How does an event listener work?</a></p>

<p>Discrete event simulation shows up in many places throughout the natural sciences, of course.  I'm procrastinating from writing right now and need to get back to it, so here's <a href="https://en.wikipedia.org/wiki/Discrete-event_simulation" rel="nofollow noreferrer">the Wikipedia entry</a> and a <a href="http://users.cs.northwestern.edu/~agupta/_projects/networking/QueueSimulation/mm1.html" rel="nofollow noreferrer">very nice tutorial lesson</a>.  </p>

CC BY-SA 4.0
2019-07-14T11:09:43.660Z
2019-07-14T11:09:43.660Z
JLasseter
<p>Turn-based games where players can drop out (either voluntarily or by losing) before the game is over. At a high level, you have a queue of players. You pop the player from the head of the queue, process their turn, and then push them back to the end of the queue.</p>

<p>Queues also have applications in simultaneous-move games, as a way of ensuring that each player gets their fair share of processing, but that's more subtle.</p>

CC BY-SA 4.0
2019-05-23T07:18:42.530Z
2019-05-23T07:18:42.530Z
Peter Taylor
<p>One example I've used for students in the past is a shared printer. </p>

<p>If I have five people using a printer all at once I will have a problem if two of the five attempt to print at the same time.  What can I do?  I can put up a sign on the printer--"Only One User At A Time Please" and hope everyone sees and follows it.  Of course then the users need to coordinate their use. </p>

<p>I can (software) lock it so that only one person can print at any time.  But when the second user tries to print he or she is blocked until the printer is free.  And the third user is blocked longer etc.</p>

<p>Or I can set up a queue.  As each user prints the print job goes to the queue.  The printer looks at the queue for jobs to print and as it prints them it removes them from the queue.  No one is blocked and the printer doesn't fail because two people try to print at the exact same moment.</p>

CC BY-SA 4.0
2019-05-22T19:17:59.207Z
I like this answer because you not only suggest that a queue be used, but also compare it with other solutions to the problem
Agnishom Chattopadhyay
CC BY-SA 4.0
2019-05-22T18:08:57.350Z
2019-05-22T18:08:57.350Z
Onorio Catenacci
<ul>
<li>Nearly everything in Unix Gnu/Linux, e.g. <code>ls | less</code>. Queues make it possible to do interprocess communication without semaphores, locks, mutexes, and all that nasty stuff. (If you can't keep it constant, then a queue is the next best thing)</li>
<li>An ethernet switch: it need to read the first 6 bytes, then route the whole lot to the desired port. To do this is delays the message through a queue, while reading the first 6 bytes, and deciding where to send it.</li>
<li>Interfacing to (slow/fast) hardware. There will be a mismatch between the speed of hardware and the routines that service them. Therefore but incoming and outgoing data into a queue. e.g. keystrokes are held in a queue until a process in ready to process them.</li>
<li>A website processes requests in the order received.</li>
</ul>

CC BY-SA 4.0
2019-05-22T19:54:41.307Z
2019-05-22T19:54:41.307Z
ctrl-alt-delor
<blockquote>
  <p>Ideally, I would like some simpler problems which can be presented with even lesser background.</p>
</blockquote>

<p>Fortunately, queues are used often in everyday scenarios. If you're just trying to teach the general First In First Out (FIFO) concept of a queue (and not necessarily how it solves more complex computing problems), then there are a lot of opportunities to show people "getting in line" / "queueing" such as:</p>

<ul>
<li>Buying tickets to a concert (e.g. Ticketmaster)</li>
<li>Grading students' work in a first-come-first-serve basis</li>
<li>Processing online orders for Packaging/Shipping (e.g. e-commerce warehouse)</li>
</ul>

<p>If you want to tie the example back to software, you can discuss any of these as a software application (i.e. online ticket sales, gradebook app, warehouse management app).
Some of these examples can also segue into more advanced topics in queueing, such as priority queues or using multiple queues.</p>

CC BY-SA 4.0
2019-07-19T19:56:57.327Z
I like that your examples are ones that students could relate to.
Ellen Spertus
CC BY-SA 4.0
2019-05-22T17:28:30.517Z
2019-05-22T17:28:30.517Z
Kevin Buffardi
<h2>The Shunting Yard Algorithm</h2>

<p>To go along with your example of evaluating RPN, you can convert infix notation into RPN with the <a href="https://en.wikipedia.org/wiki/Shunting-yard_algorithm" rel="nofollow noreferrer">Shunting Yard algorithm</a> It uses both a stack and a queue, although the queue is really only used as an FIFO output; the algorithm never reads from it. This algorithm has the benefit of being practical, and its use is immediately apparent. Plus, combined with an RPN evaluator, the students can create something they could actually use.</p>

<h2>Operating system scheduling</h2>

<p>Queues are an important part of operating system scheduling, and are the exclusive data structure used in round-robin scheduling.  A toy scheduler for cooperative tasks has a simple enough structure that it is almost trivial to implement, and gives an insight to what multi-threading looks like on a single core machine.  Talking about scheduling can also provide a lead in into other topics including asynchronous communication  and priority queues.</p>

<p>There is an added benefit of this topic: if you are a fan of talking about CS in a historical context, round robin scheduling and queues gives you an excuse to talk about the <a href="https://medium.com/delta-force/the-magic-behind-apollo-cf89aede34d4" rel="nofollow noreferrer">the moon landings</a>. </p>

CC BY-SA 4.0
2019-05-21T20:57:53.623Z
2019-05-22T04:13:22.087Z
2019-05-22T04:13:22.087Z
Soupy
<p>I am trying to introduce the idea of stacks and queues in a course on data structures.</p>

<p>For stacks, my idea was to show some interesting examples of problems, like evaluating an expression in RPN, or checking whether a bracket sequence is well bracketed.</p>

<p>What would be a good example of a few problems where queues are the canonical objects to use?</p>

<p>One example I could think of is Breadth First Search. But what else? Ideally, I would like some simpler problems which can be presented with even lesser background.</p>

CC BY-SA 4.0
2019-05-22T19:58:54.683Z
Some of the answers here are good examples of the use of a queue, but not all are easily amenable to problems that can be programmed early on.
Buffy
<student-motivation><data-structure>
What are some good problems which can be solved with a queue?
# What are some good problems which can be solved with a queue?

(Asked by: username_0 on 2019-05-21)

I am trying to introduce the idea of stacks and queues in a course on data structures.

For stacks, my idea was to show some interesting examples of problems, like evaluating an expression in RPN, or checking whether a bracket sequence is well bracketed.

What would be a good example of a few problems where queues are the canonical objects to use?

One example I could think of is Breadth First Search. But what else? Ideally, I would like some simpler problems which can be presented with even lesser background.

**Tags:** student-motivation, data-structure

> **Comments:**
> **username_1**: Some of the answers here are good examples of the use of a queue, but not all are easily amenable to problems that can be programmed early on.  

---

## 9 answers

### Answer by username_7 on 2019-05-22. Score: 7

One example I've used for students in the past is a shared printer.

If I have five people using a printer all at once I will have a problem if two of the five attempt to print at the same time. What can I do? I can put up a sign on the printer--"Only One User At A Time Please" and hope everyone sees and follows it. Of course then the users need to coordinate their use.

I can (software) lock it so that only one person can print at any time. But when the second user tries to print he or she is blocked until the printer is free. And the third user is blocked longer etc.

Or I can set up a queue. As each user prints the print job goes to the queue. The printer looks at the queue for jobs to print and as it prints them it removes them from the queue. No one is blocked and the printer doesn't fail because two people try to print at the exact same moment.

> **Comments:**
> **username_0**: I like this answer because you not only suggest that a queue be used, but also compare it with other solutions to the problem  

---

### Answer by username_8 on 2019-05-22. Score: 3

* Nearly everything in Unix Gnu/Linux, e.g. `ls | less`. Queues make it possible to do interprocess communication without semaphores, locks, mutexes, and all that nasty stuff. (If you can't keep it constant, then a queue is the next best thing)
* An ethernet switch: it need to read the first 6 bytes, then route the whole lot to the desired port. To do this is delays the message through a queue, while reading the first 6 bytes, and deciding where to send it.
* Interfacing to (slow/fast) hardware. There will be a mismatch between the speed of hardware and the routines that service them. Therefore but incoming and outgoing data into a queue. e.g. keystrokes are held in a queue until a process in ready to process them.
* A website processes requests in the order received.


---

### Answer by username_9 on 2019-05-22. Score: 3

> Ideally, I would like some simpler problems which can be presented with even lesser background.

Fortunately, queues are used often in everyday scenarios. If you're just trying to teach the general First In First Out (FIFO) concept of a queue (and not necessarily how it solves more complex computing problems), then there are a lot of opportunities to show people "getting in line" / "queueing" such as:

* Buying tickets to a concert (e.g. Ticketmaster)
* Grading students' work in a first-come-first-serve basis
* Processing online orders for Packaging/Shipping (e.g. e-commerce warehouse)

If you want to tie the example back to software, you can discuss any of these as a software application (i.e. online ticket sales, gradebook app, warehouse management app).
Some of these examples can also segue into more advanced topics in queueing, such as priority queues or using multiple queues.

> **Comments:**
> **username_10**: I like that your examples are ones that students could relate to.  

---

### Answer by username_11 on 2019-05-21. Score: 3

## The Shunting Yard Algorithm

To go along with your example of evaluating RPN, you can convert infix notation into RPN with the [Shunting Yard algorithm](https://en.wikipedia.org/wiki/Shunting-yard_algorithm) It uses both a stack and a queue, although the queue is really only used as an FIFO output; the algorithm never reads from it. This algorithm has the benefit of being practical, and its use is immediately apparent. Plus, combined with an RPN evaluator, the students can create something they could actually use.

## Operating system scheduling

Queues are an important part of operating system scheduling, and are the exclusive data structure used in round-robin scheduling. A toy scheduler for cooperative tasks has a simple enough structure that it is almost trivial to implement, and gives an insight to what multi-threading looks like on a single core machine. Talking about scheduling can also provide a lead in into other topics including asynchronous communication and priority queues.

There is an added benefit of this topic: if you are a fan of talking about CS in a historical context, round robin scheduling and queues gives you an excuse to talk about the [the moon landings](https://medium.com/delta-force/the-magic-behind-apollo-cf89aede34d4).


---

### Answer by username_1 on 2019-05-21. Score: 2

One classic type of problem is handling communications - especially asynchronous communications from multiple sources. That may be a bit much in an elementary course if you want to mostly avoid race conditions.

But a problem with a single producer and a single consumer can also be informative, though it doesn't completely avoid race conditions. Have some simple process produce some data (an object, say) and queue it. Have another process dequeue objects when available and handle them. The consumer can busy-wait on the queue in simple cases.

It is most informative when the producer is sometimes a bit faster than the consumer so that the queue normally has something to be processed. But other problems occur if it is consistently faster, of course.

You can also use such things as an introduction to the ideas around race conditions, dropped data, etc, since anomalies will eventually occur without some form of synchronization.

Such a simple setup that introduces a much deeper set of ideas is called a *Toy Box* in the Pedagogical Patterns community. The application isn't truly realistic, but gets students thinking about deeper issues that will be covered later in their education.


---

### Answer by username_2 on 2019-06-04. Score: 1

Here's a real-life example from a previous job: the [Federal Aviation Administration](https://en.wikipedia.org/wiki/Federal_Aviation_Administration) uses queueing models for a ton of their algorithms, from scheduling flight departures to rerouting flights because of severe weather.

Googling "[FAA queueing models](https://www.google.com/search?q=faa+queueing+models)" will return a ton of research papers that are pretty interesting, although probably too advanced for an introductory class. You could simplify the exercise into a simulation of an airport.

Another real-life example that I think about often are [supermarket](https://en.wikipedia.org/wiki/Supermarket) lines. Maybe make an assignment out of this question: what's the most efficient way to get X people through Y checkout lanes?

> **Comments:**
> **username_3**: You have to specify whether you want minimal average wait times, minimal maximum wait times, or minimum overall time to process. They may all net you slightly different results.  
> **username_2**: @BenI. True. I think that's good fodder for classroom discussion. :p  

---

### Answer by username_4 on 2019-05-23. Score: 1

You can do level-order traversal of a binary tree using a queue.


---

### Answer by username_5 on 2019-07-14. Score: 1

The two killer applications that immediate come to mind are event handlers and discrete event simulation. The use of queues in event handling is a little more complicated, as the process also involves interrupts (hardware and/or software) and events can be deleted from the queue before they are ever handled (for example, GUI events that become redundant when the second one happens before the first is handled), but the core mechanism is a queue. For example,

[StackExchange: How does an event listener work?](https://softwareengineering.stackexchange.com/questions/363397/how-does-an-event-listener-work)

Discrete event simulation shows up in many places throughout the natural sciences, of course. I'm procrastinating from writing right now and need to get back to it, so here's [the Wikipedia entry](https://en.wikipedia.org/wiki/Discrete-event_simulation) and a [very nice tutorial lesson](http://users.cs.northwestern.edu/~agupta/_projects/networking/QueueSimulation/mm1.html).


---

### Answer by username_6 on 2019-05-23. Score: 1

Turn-based games where players can drop out (either voluntarily or by losing) before the game is over. At a high level, you have a queue of players. You pop the player from the head of the queue, process their turn, and then push them back to the end of the queue.

Queues also have applications in simultaneous-move games, as a way of ensuring that each player gets their fair share of processing, but that's more subtle.


---

