Stacks, Queues, and Deques

Explore Basic Abstract Data Types
Published

February 22, 2025

Exploration

  • Read chapters 6 and 7 in A First Course on Data Structures in Python
  • Try out the implementations of Stack, Queue, and Deque in the ds2 package of donsheehy/datastructures. Can you write your own tests cases for these data structures? Can you use these data structures in your own program?
  • Note that, along with chapter 8, chapter 7 will again be the focus for next week

Activities

  • Tuesday and Thursday: Stacks, Queues, and Deques
    • Explore the concept of an abstract data type (ADT)
    • Understand implementation trade-offs for stacks, queues, and deques
    • Use asymptotic analysis to characterize performance of an ADT
    • Enhance an ADT implementation with useful exception handling
    • Examine Python source code segments to illustrate key points
  • Friday: Continue algorithm engineering project four (see the prior week for details about this project) and take mid-term examination one

Slides

Full Screen: Week Seven: Implementing Stack, Queues, and Deques

Back to top