Outline:

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

What’s next

Upcoming events/assessments:

• CS Bits and Bytes (bonus!) Tuesday 12pm-1pm in Olin 308: Austin Dahl ‘88 on job search and interview tips
• CS Bits and Bytes Thursday at 3:30pm in Anderson 329: Alex Dixon ‘01 (at Adobe) on HDR photo editing
• Assignment 4 will be released Friday
• Assignments 1 and 2 resubmissions are due tonight at 10pm
• Exam Day #1 is on Friday

What you should do now:

• The readings (see below)
• Resubmit Assignment 1 and Assignment 2 if you haven’t already

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

Queues (from today):

• Queues

Another linear data structure (for next time):

• Circular queue