Outline:

0. Recap from Lesson 5
1. Questions?
2. Stack ADT
   • definition and example
   • time complexity
   • list-based implementation: Exercise 1
3. Example stack usage: maze solving
4. Wrap-up

Explore after class:

5. More stack-based problem solving: Exercise 2

What’s next

Upcoming assessments:

• Assignment 2 is due tonight
• Quiz 2 will be next Monday and cover the following Quiz Learning Objectives:
  • Core:
    • LT 1: array-based lists
    • LT 2: core array-based list time complexity
    • SQ 1: stacks
    • SQ 2: core stack time complexity
  • Advanced:
    • KF 5: collections
    • OO 2: interfaces
    • LT 5: array-based list time complexity
  • Repeats from before:
    • KF 3: loops (CR)

What you should do now:

• The readings (see below)
• Finish Assignment 2 and submit it by tonight
• Look at feedback from Assignment 1 and work on a resubmission!
• Read the description of Assignment 3 and try out Part A this weekend!

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

Solving problems with stacks (from today):

• Stack Data Structure
• Backtracking with Stacks
• Solving Mazes Using Stacks

Inheritance (for next time):

• Inheritance
• Another take on inheritance