When should you use Python’s built-in data types, and when should you develop your own? In this video course, George Heineman introduces Python programmers to several important data structures and demonstrates their use with example algorithms. Generic data structures such as arrays, linked lists, and stacks can solve many problems, but to work through some specialized problems, you need to learn different ways to structure data appropriately.
Many Python programmers learned their skills through non-traditional routes, rather than through an undergraduate computer science degree. This video helps complete your education in fundamental data types step-by-step. For many of the data structures, you’ll write sample code using a variety of existing modules, and define a process that will help you evaluate and assess these modules for use in your own software. All you need to get started is a working knowledge of Python's built-in data types.
Topics include:
Built-in Python data structures Python standard library types Design principles for data structures Data structures and associated algorithm examples Graph representations Heaps, circular buffers, balanced binary trees, and their variants
George T. Heineman is an Associate Professor of Computer Science at WPI. His research interests are in Software Engineering. He co-edited the 2001 book "Component-Based Software Engineering: Putting the Pieces Together". He is nearly half-way towards his childhood goal of writing one million lines of code.
Aside from his professional pursuits, George is an avid puzzler. He invented Sujiken(R), a Sudoku variation played on a right-triangle arrangement of cells in which numbers cannot repeat in a horizontal row, vertical column or diagonal in any direction. "