Data Structures & Algorithms in Python 1st Edition By Robert Lafore, Alan Broder, John Canning
$30.00
Secure checkout
Instant digital download
PDF document
Document details
- Pages
- 920
- File size
- 20.42 MB
- Format
- Digital PDF
- Category
- eBook[PDF]
Sign in or create a free account to continue. Your purchase will be saved in My Downloads.
About this ebook
The 1st edition of Data Structures & Algorithms in Python by Robert Lafore, Alan Broder, and John Canning covers a comprehensive list of core computer science topics structured into 16 main chapters: [1]
Core Topics & Chapter Outline
- Overview: Introduction to data structures, algorithms, and fundamental Python programming concepts (dynamic typing, object-oriented programming, and Big O notation).
- Arrays: Using Python lists to implement an Array class, sequential/linear search, binary search, and storing database records.
- Simple Sorting: Bubble sort, selection sort, and insertion sort algorithms.
- Stacks and Queues: Standard stacks, queues, and priority queues, including error handling and application use cases.
- Linked Lists: Single linked lists, double-ended lists, Abstract Data Types (ADTs), doubly linked lists, circular lists, and iterators.
- Recursion: Thinking recursively, triangular numbers, anagrams, recursive binary searches, the Tower of Hanoi, and merge sort foundation.
- Advanced Sorting: Shellsort, partitioning algorithms, and Quicksort.
- Binary Trees: Tree terminology, finding nodes, inserting nodes, tree traversals, deleting nodes, and the efficiency of binary trees.
- 2-3-4 Trees and External Storage: Multiway trees, searching and inserting in a 2-3-4 tree, and organizing external disk storage.
- AVL and Red-Black Trees: Tree balance, AVL trees (rotations and implementations), and Red-Black trees.
- Hash Tables: Introduction to hashing, linear probing, quadratic probing, separate chaining, and hashing efficiency.
- Spatial Data Structures: Multi-dimensional data, Grid data structures, Quadtrees, and 2D-Trees.
- Heaps: Introduction to heaps, insertion, deletion, and the Heapsort algorithm.
- Graphs: Introduction to graphs, depth-first search (DFS), breadth-first search (BFS), minimum spanning trees, and topological sorting.
- Weighted Graphs: Minimum spanning trees with weighted edges, Dijkstra’s algorithm for the shortest path problem, and the all-pairs shortest-path problem.
- What to Use and Why: A concluding guide on how to choose the right data structure and algorithm for specific, real-world engineering problems. [1, 2, 3, 4]
Appendices
- Appendix A: Running the accompanying graphical program visualizations.
- Appendix B: Further reading and external computer science resources.
- Appendix C: Answers to review questions found throughout the text. [1]
File included
tmpphprBncZU
20.42 MB
Related ebooks
