Data structures serve as a foundation upon which many other computer science fields are built. Some knowledge of data structures is thus a prerequisite for students who wish to work in the design, implementation, testing, or maintenance of virtually any software system. As a flexible and easy-to-use programming language, Python has made steady gains in popularity in industry and academia. This book will help many students who already know Python learn data structures.
Chapter 1 Object-Oriented Programming Using Python
Chapter 2 Complexity Analysis
Chapter 3 Linked Lists
Chapter 4 Stacks and Queues
Chapter 5 Recursion
Chapter 6 Binary Trees
Chapter 7 Multiway Trees
Chapter 8 Graphs
Chapter 9 Sorting
Chapter 10 Hashing
Chapter 11 Data Compression
Chapter 12 Memory Management
Chapter 13 String Matching
Appendices
Name Index
Subject Index
-
Adam Drozdek
A well respected author and dedicated instructor, Dr. Adam Drozdek serves as Associate Professor of Computer Science at Duquesne University, where he teaches courses in operating systems and computer architecture, advanced data structures and other advanced computer science courses. Dr. Drozdek has authored numerous successful books, including THE ELEMENTS OF DATA COMPRESSION. He earned his B.S. and M.A. from Wrocław University, his M.S. from Wright State University, and Ph.D. from Jagiellonian University.
-
Emphasizes the connection between data structures and their algorithms, with an analysis of the algorithms’ complexity
-
Presents data structures in the context of object-oriented program design
-
Illustrates the complete context in which certain algorithms and data structures can be used through case studies
-
Examines the efficiency of algorithms with theoretical analysis, with suggestions to improve them
-
Simplifies the understanding of recursion by considering run-time stacks together with the algorithms
-
Emphasizes the connection between data structures and their algorithms, with an analysis of the algorithms’ complexity
-
Presents data structures in the context of object-oriented program design
-
Illustrates the complete context in which certain algorithms and data structures can be used through case studies
-
Examines the efficiency of algorithms with theoretical analysis, with suggestions to improve them
-
Simplifies the understanding of recursion by considering run-time stacks together with the algorithms