Outline:

1. Registering for your next CS course via the CS Match
2. Recap: doubly linked list
3. ADT: Deque
   • overview
   • ideal time complexity
4. Lab #3: practice implementing doubly linked lists

What’s next

Upcoming events/assessments:

• CS Bits and Bytes Thursday from 4:30pm-5:30pm in Olin 149: John Clapp ‘91 from Deriva Energy
• Carleton Undergraduate Research Symposium: Friday Oct. 17 from 4:30-5:30pm in the Rec Center
• Assignment 4 is due Thursday

What you should do now:

• Try to complete Part A of Assignment 4
• Look at CS Courses on Workday and fill out your Match form
• The readings for Wednesday

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

More linear data structures (from today):

• Doubly-linked lists
• Deques

Hashing (for next time):

• Hash tables