Week 5: List-based ADTs (cont'd): Stacks and Queues + 1st midterm on Friday
----------------------------------------------------------------------------

This week, we finished with stacks, by reviewing the DFS algorithm, and explaining how this 
algorithm is important to solve the problem given in lab.

We then began to review queues:
- definition
- operations on queues
- use of queues: simulate queues of people, discrete event simulation
and we modified the algorithm of DFS by replacing stacks for queues. Question: what does the
new algorithm produce?

===============================================================
Friday session will be dedicated to the 2st midterm.
Guidelines to get ready for the midterm are available on this website.