- Data Structures and Algorithms with Python
- Table of contents (20 chapters)
- Front Matter
- Python Programming 101
- Computational Complexity
- Recursion
- Sequences
- Sets and Maps
- Trees
- Graphs
- Membership Structures
- Heaps
- Balanced Binary Search Trees
- B-Trees
- Heuristic Search
- Appendix A: Integer Operators
- Appendix B: Float Operators
- Appendix C: String Operators and Methods
- Appendix D: List Operators and Methods
- Appendix E: Dictionary Operators and Methods
- Appendix F: Turtle Methods
- Appendix G: TurtleScreen Methods
- About this book
- Keywords
- Authors and Affiliations
- Luther College, Decorah, USA
- About the authors
- Bibliographic Information
- Data Structures and Algorithms in Python
- Book description
- Table of contents
- Product information
- Best Python Data Structures And Algorithms Books
- Best books for data structures and algorithms in python
- 1. Data Structures and Algorithms in Python Book
- 2. Data Structure and Algorithmic Thinking with Python
- 3. Problem Solving with Algorithms and Data Structures Using Python
- 4. Python Data Structures and Algorithms Book
- Is Python Good or Bad For DSA?
- Should I Learn DSA From Books Only?
- Which Is The Best Book Data Structures And Algorithms Book In Python?
- Summary
Data Structures and Algorithms with Python
This is a preview of subscription content, access via your institution.
Table of contents (20 chapters)
Front Matter
Python Programming 101
Computational Complexity
Recursion
Sequences
Sets and Maps
Trees
Graphs
Membership Structures
Heaps
Balanced Binary Search Trees
B-Trees
Heuristic Search
Appendix A: Integer Operators
Appendix B: Float Operators
Appendix C: String Operators and Methods
Appendix D: List Operators and Methods
Appendix E: Dictionary Operators and Methods
Appendix F: Turtle Methods
Appendix G: TurtleScreen Methods
About this book
This textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently. Project-oriented and classroom-tested, the book presents a number of important algorithms supported by examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. Features: includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface; provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples; offers downloadable programs and supplementary files at an associated website, with instructor materials available from the author; presents a primer on Python for those from a different language background.
Keywords
- Algorithms
- Computational Complexity
- Data Structures
- Programming
- Python
- algorithm analysis and problem complexity
Authors and Affiliations
Luther College, Decorah, USA
About the authors
Dr. Kent D. Lee is Professor of Computer Science at Luther College, Decorah, Iowa, USA. He is the author of the successful Springer textbook Python Programming Fundamentals and the forthcoming Foundations of Programming Languages.
Dr. Steve Hubbard is Professor of Mathematics and Computer Science at Luther College.
Bibliographic Information
- Book Title : Data Structures and Algorithms with Python
- Authors : Kent D. Lee, Steve Hubbard
- Series Title : Undergraduate Topics in Computer Science
- DOI : https://doi.org/10.1007/978-3-319-13072-9
- Publisher : Springer Cham
- eBook Packages : Computer Science , Computer Science (R0)
- Copyright Information : Springer Nature Switzerland AG 2015
- Softcover ISBN : 978-3-319-13071-2 Published: 22 January 2015
- eBook ISBN : 978-3-319-13072-9 Published: 12 January 2015
- Series ISSN : 1863-7310
- Series E-ISSN : 2197-1781
- Edition Number : 1
- Number of Pages : XV, 363
- Number of Illustrations : 8 b/w illustrations, 139 illustrations in colour
- Topics : Data Science , Python , Algorithms , Programming Techniques
Data Structures and Algorithms in Python
Read it now on the O’Reilly learning platform with a 10-day free trial.
O’Reilly members get unlimited access to books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Book description
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++.
Table of contents
- Cover Page
- Title Page
- Copyright
- Dedication
- Preface
- Book Features
- Online Resources
- Contents and Organization
- Prerequisites
- Relation to Computer Science Curriculum
- About the Authors
- Additional Books by These Authors
- Acknowledgments
- 1.1 Python Overview
- 1.2 Objects in Python
- 1.3 Expressions, Operators, and Precedence
- 1.4 Control Flow
- 1.5 Functions
- 1.5.1 Information Passing
- 1.6 Simple Input and Output
- 1.7 Exception Handling
- 1.8 Iterators and Generators
- 1.9 Additional Python Conveniences
- 1.10 Scopes and Namespaces
- 1.11 Modules and the Import Statement
- 1.12 Exercises
- 2.1 Goals, Principles, and Patterns
- 2.2 Software Development
- 2.3 Class Definitions
- 2.4 Inheritance
- 2.5 Namespaces and Object-Orientation
- 2.6 Shallow and Deep Copying
- 2.7 Exercises
- 3.1 Experimental Studies
- 3.2 The Seven Functions Used in This Book
- 3.3 Asymptotic Analysis
- 3.4 Simple Justification Techniques
- 3.5 Exercises
- 4.1 Illustrative Examples
- 4.2 Analyzing Recursive Algorithms
- 4.3 Recursion Run Amok
- 4.4 Further Examples of Recursion
- 4.5 Designing Recursive Algorithms
- 4.6 Eliminating Tail Recursion
- 4.7 Exercises
- 5.1 Python’s Sequence Types
- 5.2 Low-Level Arrays
- 5.3 Dynamic Arrays and Amortization
- 5.4 Efficiency of Python’s Sequence Types
- 5.5 Using Array-Based Sequences
- 5.6 Multidimensional Data Sets
- 5.7 Exercises
- 6.1 Stacks
- 6.2 Queues
- 6.3 Double-Ended Queues
- 6.4 Exercises
- 7.1 Singly Linked Lists
- 7.2 Circularly Linked Lists
- 7.3 Doubly Linked Lists
- 7.4 The Positional List ADT
- 7.5 Sorting a Positional List
- 7.6 Case Study: Maintaining Access Frequencies
- 7.7 Link-Based vs. Array-Based Sequences
- 7.8 Exercises
- 8.1 General Trees
- 8.2 Binary Trees
- 8.3 Implementing Trees
- 8.4 Tree Traversal Algorithms
- 8.5 Case Study: An Expression Tree
- 8.6 Exercises
- 9.1 The Priority Queue Abstract Data Type
- 9.2 Implementing a Priority Queue
- 9.3 Heaps
- 9.4 Sorting with a Priority Queue
- 9.5 Adaptable Priority Queues
- 9.6 Exercises
- 10.1 Maps and Dictionaries
- 10.2 Hash Tables
- 10.3 Sorted Maps
- 10.4 Skip Lists
- 10.5 Sets, Multisets, and Multimaps
- 10.6 Exercises
- 11.1 Binary Search Trees
- 11.2 Balanced Search Trees
- 11.3 AVL Trees
- 11.4 Splay Trees
- 11.5 (2,4) Trees
- 11.6 Red-Black Trees
- 11.7 Exercises
- 12.1 Why Study Sorting Algorithms?
- 12.2 Merge-Sort
- 12.3 Quick-Sort
- 12.4 Studying Sorting through an Algorithmic Lens
- 12.5 Comparing Sorting Algorithms
- 12.6 Python’s Built-In Sorting Functions
- 12.7 Selection
- 12.8 Exercises
- 13.1 Abundance of Digitized Text
- 13.2 Pattern-Matching Algorithms
- 13.3 Dynamic Programming
- 13.4 Text Compression and the Greedy Method
- 13.5 Tries
- 13.6 Exercises
- 14.1 Graphs
- 14.2 Data Structures for Graphs
- 14.3 Graph Traversals
- 14.4 Transitive Closure
- 14.5 Directed Acyclic Graphs
- 14.6 Shortest Paths
- 14.7 Minimum Spanning Trees
- 14.8 Exercises
- 15.1 Memory Management
- 15.2 Memory Hierarchies and Caching
- 15.3 External Searching and B-Trees
- 15.4 External-Memory Sorting
- 15.5 Exercises
Product information
- Title: Data Structures and Algorithms in Python
- Author(s):
- Release date: March 2013
- Publisher(s): Wiley
- ISBN: 9781118290279
Best Python Data Structures And Algorithms Books
Last updated June 6, 2023 by Jarvis Silva In this article I will share with you the best python data structures and algorithms books to read if you want to learn DSA, Learning data structures and algorithms can be very difficult for beginners, some DSA concepts are complex and difficult to understand. DSA is very important if you want to get a job or improve your programming skill so you need to learn them as a programmer if you are python programmer then you can learn DSA in python
Best books for data structures and algorithms in python
- Data Structures and Algorithms in Python Book.
- Data Structure and Algorithmic Thinking with Python.
- Problem Solving with Algorithms and Data Structures Using Python.
- Python Data Structures and Algorithms Book.
1. Data Structures and Algorithms in Python Book
Our first book is data structures and algorithms in python. It is written by Michael T. Goodrich, who is a computer scientist. In this book, you will learn all the DSA concepts and implementation in python.
This book is very beginner-friendly. It provides clear and simple explanations of DSA concepts, which makes it very easy to understand them.
Author: Michael T. Goodrich
Ratings: 4.5 out of 5
This book will help to learn dsa in best way, so if you want this book you can get it on Amazon here: Data Structures and Algorithms in Python Book.
2. Data Structure and Algorithmic Thinking with Python
This book is written by Narasimha Karumanchi, who is a software developer and has written many books on DSA. This book covers all the data structures and algorithms topics from beginning to advanced.
This book is specially written for new programmers, job hunters and those who are appearing for exams. This book has exercises and puzzles to improve your logical thinking.
All the code implementation is in the python programming language, this book provides a practical way of learning data structures and algorithms.
Author: Narasimha Karumanchi
Ratings: 4.5 out of 5
This book is loved by a lot of developers, and I personally loved this book. If you want to get this book, then you can get it here: Data Structure and Algorithmic Thinking with Python.
3. Problem Solving with Algorithms and Data Structures Using Python
This data structures and algorithms book is all about problem solving which is the most important part in DSA. It will teach you how to approach and solve a particular DSA problem.
This book will teach you the concepts of data structures and algorithms. You will have problems to solve, which will help you understand and remember the concepts better.
Author: Bradley N Miller
Ratings: 4.5 out of 5
This book has a lot of valuable knowledge locked into it. If you want to unlock this knowledge, then you can go here: Problem Solving with Algorithms and Data Structures Using Python.
4. Python Data Structures and Algorithms Book
This book is written by three authors who are very specialized in DSA. This book provides a definitive introduction, design and analysis of data structures and algorithms in python programming.
You will learn about the techniques, strategies and concepts of DSA from this book. It has exercises and problems which you can solve to improve your DSA skills.
Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Ratings: 4.5 out of 5
This book is a complete DSA learning resource if you want to get this book then you can go here: Python Data Structures and Algorithms Book.
Is Python Good or Bad For DSA?
As I have, you can learn data structures and algorithms in any programming language, it does not matter. If you understand the DSA concepts, you can use it in any programming language to solve problems.
Using python can give you a lot of benefits. First, python syntax is handy and short and there is a lot of complexity which gets removed when programming in python.
Should I Learn DSA From Books Only?
Learning Data structures and algorithms from books only is not recommended. You can surely learn from books only,, but now there are many video courses on YouTube or other platforms.
From which you can learn DSA, so you should take a DSA course while reading a DSA book because this helps to remember and understand the DSA concepts better and faster.
This is what I did, I read multiple books on DSA along with multiple courses because I found it difficult to understand some concepts so by learning from multiple resources I finally learned them.
Which Is The Best Book Data Structures And Algorithms Book In Python?
From all the DSA books I have mentioned, in my opinion the best DSA book in python is Data Structure and Algorithmic Thinking with Python Book.
I loved this book because I found it very easy to understand the concepts of DSA from this book and it also has exercises which helps to learn better and faster.
This does not make other books bad. All these books provide equal knowledge. Each of them have their own pros and cons, so you go through each book and get the book you think you will find helpful.
Summary
These were all the best python dsa books you can read, All these books are available on Amazon to purchase, you can visit the link and get them.
Here are some more book guides in python :
I hope you found this article helpful and you found the books you were looking for. We will update more books in this article in the future, to get updates join our Telegram channel.
Thank you for reading, have a nice day 🙂