Directions:

One normal aspect of life is to wait in line for something$--$waiting for a bank teller to give you service, waiting in the security line in the airport, or even waiting for your turn in a restaurant to be seated. In all these scenarios, it is the idea to service whoever comes first $($basically First In First Out, or FIFO$).$ Sometimes the situations can be tricky as those people waiting in line can be of different priorities and it will be more appropriate to serve those with higher priority before attending to these with lower priority. In programming, we call the above scenarios queues and priority queues.

For this discussion, answer the following two questions:

What are some practical applications for queues, priority queues and deques? $($You learned about deques in the online lecture and also in the text.$)$

What are the options for implementing these three data structures, and what are the pros and cons for each approach?