Outline:

1. Questions?
2. Quiz #3
3. Queue ADT
   • definition and example
   • comparison to a stack
   • array-based implementation: Exercise 1
   • circular-array implementation (if time)
4. Wrap-up

What’s next

• Assignment 1 resubmissions are due tonight at 10pm!
• Assignment 3 is due Wednesday
• Assignment 4 will be released Wednesday

What you should do now:

• The readings (see below)
• Finish Assignment 3 and resubmit Assignment 1

Reading assignment (to be completed by the next class):

Queues (from today):

• Queues
• Circular queue

List implementations (for next time):

• Doubly-linked lists
• Deques