Lecture 13

Learning objectives

After this class, you should be able to:

1. Write code using STL stack, queue, and priority_queue classes.
2. Given a problem, design an algorithm to solve it, using stacks, queues, and priority queues.

Reading assignment

1. Section , section 4.4-4.7.
2. Look over previous review questions and start preparing for the midterm.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Write code to implement a solution to Chapter 4, exercise 3a, using STL.
  2. Write code to implement a solution to Chapter 4, exercise 3b, using STL.
  3. Write code to implement a solution to Chapter 4, exercise 5a, using STL.
  4. Write code to implement a solution to Chapter 4, exercise 5b, using STL.

• Questions on next lecture's material
  1. Look over previous review questions and start preparing for the midterm.

---

Last modified: 5 Oct 2009