Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010242743 | QA76.73 P98 G66 2013 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Based on the authors' market leading data structures books in Java and C++, this textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. Data Structures and Algorithms in Python is the first mainstream object-oriented book available for the Python data structures course. Designed to provide a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation, the text will maintain the same general structure as Data Structures and Algorithms in Java and Data Structures and Algorithms in C++.
Author Notes
Michael Goodrich, PhD in Computer Science from Purdue University, 1987; Chancellor's Professor of Computer Science at University of California, Irvine; co-author (with Tamassia) of three other Wiley textbooks and a new computer security text, Addison Wesley, 2011.
Roberto Tamassia, PhD in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign, 1988; Plastech Professor of Computer Science and Chair of the CS Dept at Brown University; co-author with Goodrich, see texts above.
Michael Goldwasser, PhD in Computer Science from Stanford University, 1997; Associate Professor and Director of CS at St. Louis University; author of Object-Oriented Programming in Python, Pearson, 2008.
Table of Contents
| Chapter 1 Python Programming Basics |
| Chapter 2 Object-Oriented Design |
| Chapter 3 Analysis Tools and Recursion |
| Chapter 4 Stacks, Queues, and Deques |
| Chapter 5 Sequence Abstractions |
| Chapter 6 Tree Structures |
| Chapter 7 Priority Queues |
| Chapter 8 Maps and Dictionaries |
| Chapter 9 Search Tree Structures |
| Chapter 10 Sorting, Sets, and Selection |
| Chapter 11 Strings and Dynamic Programming |
| Chapter 12 Graph Algorithms |
| Chapter 13 Memory Management and B-trees |
| Appendix A Useful Mathematical Facts |
