Learn to implement complex data structures and algorithms using Python
Key Features
- Understand the analysis and design of fundamental Python data structures
- Explore advanced Python concepts such as Big O notation and dynamic programming
- Learn functional and reactive implementations of traditional data structures
Book Description
Data structures allow you to store and organize data efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. Hands-On Data Structures and Algorithms with Python teaches you the essential Python data structures and the most common algorithms for building easy and maintainable applications.
This book helps you to understand the power of linked lists, double linked lists, and circular linked lists. You will learn to create complex data structures, such as graphs, stacks, and queues. As you make your way through the chapters, you will explore the application of binary searches and binary search trees, along with learning common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. In the concluding chapters, you will get to grips with organizing your code in a manageable, consistent, and extendable way. You will also study how to bubble sort, selection sort, insertion sort, and merge sort algorithms in detail.
By the end of the book, you will have learned how to build components that are easy to understand, debug, and use in different applications. You will get insights into Python implementation of all the important and relevant algorithms.
What you will learn
- Understand object representation, attribute binding, and data encapsulation
- Gain a solid understanding of Python data structures using algorithms
- Study algorithms using examples with pictorial representation
- Learn complex algorithms through easy explanation, implementing Python
- Build sophisticated and efficient data applications in Python
- Understand common programming algorithms used in Python data science
- Write efficient and robust code in Python 3.7
Who this book is for
This book is for developers who want to learn data structures and algorithms in Python to write complex and flexible programs. Basic Python programming knowledge is expected.
Table of Contents
- Python objects, types and expressions
- Python Data Types and Structures
- Principles of Algorithm Design
- Lists and pointer structures
- Stacks and Queues
- Trees
- Hashing and symbol tables
- Graphs and other algorithms
- Searching
- Sorting
- Selection Algorithms
- String algorithms and techniques
- Design techniques and strategies
- Implementations, applications and tools
Dr. Basant Agarwal works as an associate professor at Swami Keshvanand Institute of Technology, Management, and Gramothan, India. He has been awarded an M.Tech and PhD from MNIT, Jaipur, India, and has more than 8 years' experience in academia and research. He has been awarded the prestigious PostDoc Fellowship by ERCIM (the European Research Consortium for Informatics and Mathematics) through the Alain Bensoussan Fellowship Programme. He has also worked at Temasek Laboratories, the National University of Singapore, Singapore. He has authored a book on sentiment analysis in the Springer Book Series: Socio-Affective Computing series, and is published in more than 50 reputed conferences and journals. His research interests are focused on NLP, machine learning, and deep learning.
Benjamin Baka works as a software developer who considers himself to be language agnostic and thus seeks out the elegant solutions to which his toolset can enable him to accomplish. Notable amongst ones are C, Java, Python, and Ruby. With a huge interest in algorithms, he seeks to always write code that borrows from Dr. Knuth's words, both simple and elegant. He also enjoys playing the bass guitar and listening to silence. He currently works with mPedigree Network.
