Outline:

1. Questions?
2. Stack ADT
   • abstract data types
   • stack ADT: definition and example
   • list-based implementation: Exercise 1
   • array-based implementation: Exercise 2
3. Example: maze solving
4. Wrap-up

Explore after class:

5. More stack-based problem solving: Exercise 3

What’s next

Upcoming assignments/events:

• Assignment 2 is due today
• Assignment 3 will be released later today, and is all about stacks!
• CS Bits & Bytes is hosting a board game hang-out this Thursday from 3:30-4:30pm in Olin 304/306/308 :)

What you should do now:

• The readings (see below)
• Submit Assignment 2
• Read the description of Assignment 3 – it’ll be online soon

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

Solving problems with stacks (from today):

• Backtracking with Stacks
• Solving Mazes Using Stacks

Linked lists (for next time):

• Singly Linked Lists