Data Structures and Algorithms Using Python

More and more programmers are turning to Python and this book will give them the understanding they need. Necaise introduces the basic array structure and explores the fundamentals of implementing and using multi-dimensional arrays. The underlying mechanisms of many of Python’s built-in data structures and constructs are covered. A number of ADTs and applications are discussed as threads throughout the book to allow for multiple implementations as new data structures are introduced. Real-world applications of the various chapter topics are also presented. This gives programmers complete coverage of abstraction and the basic data structures and algorithms in the Python language.

And now for something completely different…

This book is designed for a data structures and algorithms course that uses Python. A key objective is to provide a "back to basics" approach to learning data structures and algorithms without overwhelming the reader with all of the object-oriented programming terminology and concepts. To provide flexibility in topic coverage for a wide variety of courses, the author focuses on data structures and algorithms, while designing the examples to allow the introduction of object-oriented programming if so desired. The book also introduces the concept of algorithm analysis and explores the efficiency of algorithms and data structures throughout the text.

Hallmark Features

• Provides complete coverage of abstraction and the basic data structures and algorithms using a "back to basics" approach.
• Python (version 3) used to design and implement classes for abstract data types and programs and algorithms.
• Flexible organziation allows coverage of class inheritance as needed or desired.
• Introduces students to the basic array structure and the fundamentals of implementing and using multi-dimensional arrays.
• The underlying mechanism of many of Python's built-in data structures and constructs are explored in order to expose the "magic" and to evaluate their efficiency.
• Sample applications of various chapter topics are presented throughout the text to help engage students.
• A number of ADTs and applications are presented as threads throughout the text (i.e. the Set, Bag, Matrix, Sparse Matrix, and Map ADTs.) This allows for multiple implementations as new data structures are introduced, which provides the opportunity to reinforce the abstraction concept and for studying algorithm efficiency.