Outline:

1. Registering for your next CS course via the CS Match
2. ADT: Deque
   • overview
   • ideal time complexity
3. Doubly linked list
   • recap: high-level idea
   • Lab #3: practice implementing doubly linked lists

What’s next

• Assignment 2 resubmissions are due tonight at 10pm!
• Assignment 4 is due Thursday
• No new assignments over midterm break – work on any token-based resubmissions (due next week!)

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):

List implementations (from today):

• Doubly-linked lists
• Deques

Hashing (for next time):

• Hash tables