Data Structures and Algorithms in Python
'Data Structures and Algorithms in Python' combines the elegance of Python with the rigorous discipline of data structures and algorithmic analysis. Providing an authoritative exploration of computer science fundamentals, this work demonstrates how to implement robust, scalable algorithms using idiomatic Python.
Core subjects include Big-O notation, recursion, array sequences, linked structures, stacks, queues, trees, priority heaps, hash tables, graph algorithms (DFS, BFS, Dijkstra), and dynamic programming. The book presents comprehensive implementations accompanied by mathematical analysis and design patterns.
An indispensable resource for Python developers, data engineers, and computer science students seeking to master algorithmic problem-solving.
Core subjects include Big-O notation, recursion, array sequences, linked structures, stacks, queues, trees, priority heaps, hash tables, graph algorithms (DFS, BFS, Dijkstra), and dynamic programming. The book presents comprehensive implementations accompanied by mathematical analysis and design patterns.
An indispensable resource for Python developers, data engineers, and computer science students seeking to master algorithmic problem-solving.
Contents at a Glance
Chapter 1: Python Primer and Object-Oriented Design
Chapter 2: Object-Oriented Programming and Inheritance in Python
Chapter 3: Algorithm Analysis, Asymptotic Notation (Big-O)
Chapter 4: Recursion and Mathematical Induction
Chapter 5: Array-Based Sequences (Dynamic Arrays, Tuples, Strings)
Chapter 6: Stacks, Queues, and Deques in Python
Chapter 7: Singly, Doubly, and Circular Linked Lists
Chapter 8: Trees: General Trees, Binary Trees, and Traversals
Chapter 9: Priority Queues and Heaps
Chapter 10: Maps, Hash Tables, and Skip Lists
Chapter 11: Search Trees: BSTs, AVL Trees, and Splay Trees
Chapter 12: Sorting and Selection Algorithms
Chapter 13: Text Processing and Pattern Matching (KMP, Boyer-Moore)
Chapter 14: Graph Algorithms: DFS, BFS, Dijkstra, and Minimum Spanning Trees
Index & Further Reading
Chapter 1: Python Primer and Object-Oriented Design
Chapter 2: Object-Oriented Programming and Inheritance in Python
Chapter 3: Algorithm Analysis, Asymptotic Notation (Big-O)
Chapter 4: Recursion and Mathematical Induction
Chapter 5: Array-Based Sequences (Dynamic Arrays, Tuples, Strings)
Chapter 6: Stacks, Queues, and Deques in Python
Chapter 7: Singly, Doubly, and Circular Linked Lists
Chapter 8: Trees: General Trees, Binary Trees, and Traversals
Chapter 9: Priority Queues and Heaps
Chapter 10: Maps, Hash Tables, and Skip Lists
Chapter 11: Search Trees: BSTs, AVL Trees, and Splay Trees
Chapter 12: Sorting and Selection Algorithms
Chapter 13: Text Processing and Pattern Matching (KMP, Boyer-Moore)
Chapter 14: Graph Algorithms: DFS, BFS, Dijkstra, and Minimum Spanning Trees
Index & Further Reading
