Join Erin Allard for an in-depth discussion in this video What you should know, part of Python Data Structures: Stacks, Queues, and Deques.
- [Instructor] In order to get the most out of this course, there are a few concepts you should know. The first is Python's built-in list data type. Specifically knowing about the list data types built-in append method, pop method, insert method, and how to index into a list. You'll also want to know about classes in Python. How classes have attributes, methods, and how to instantiate objects. You'll also want to know at least the basics about how to calculate runtime.
Specifically constant runtime, also called oh of one and linear runtime, also called oh of N. If you need a refresher on any of those concepts, here are a couple LinkedIn Learning courses you can check out. The first one called Python Essential Training has a really great chapter on classes. The second one called Programming Foundations: Object-Oriented Design gives a great overview about object-oriented programming. You can follow along with me by downloading Python 3.
I'll be coding in Atom which is my favorite text editor but you can use whichever one you like. I'll be running my Python files from the terminal and you can use your favorite CLI tool. I recommend you create your own Python files on your machine and code with me throughout the course. I've also made my completed Python files available for you to download in case you want to use them as a resource.
- Abstract types and data structures
- Stacks as a linear abstract data type
- Creating the Stack class and its methods
- Adding items to the top and bottom of a stack
- Creating the Queue class and its methods
- Manipulating items in a queue
- Creating the Dequeue class and its methods
- Adding and removing items from a dequeue