Software developers know that efficient underlying architecture is essential to the technologies we use every day. Knowledge of data structures, and the supported algorithms, helps developers choose the most suitable solution for a given context, making them better programmers who stand out to their company, clients, or prospective employers. In this course, leveraging the Python programming language, instructor Robin Andrews uses a combo of visual, theoretical, and hands-on programming approaches to explain concepts in a fun and accessible way. Robin explains some of the most important data structures such as stacks, queues, and priority queues, and how these are used by search algorithms such as depth-first search, breadth-first search, and the A-star (A*) algorithm. He shows how to trace the execution of algorithms, which is useful for path finding within mazes.

• Introduction
• 1. Pathfinding Algorithms in a Maze Game
• 2. The Stack Data Structure
• 3. The 2D List Data Structure
• 4. Depth-First Search Algorithm
• 5. The Queue Data Structure
• 6. The Breadth-First Search Algorithm
• 7. The Priority Queue Data Structure
• 8. The A* Search Algorithm
• Conclusion