Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Hands-On Data Structures and Algorithms with Python – Third Edition
  • Table Of Contents Toc
Hands-On Data Structures and Algorithms with Python – Third Edition

Hands-On Data Structures and Algorithms with Python – Third Edition - Third Edition

By : Dr. Basant Agarwal
4.8 (26)
Buy this Book
close
close
Hands-On Data Structures and Algorithms with Python – Third Edition

Hands-On Data Structures and Algorithms with Python – Third Edition

4.8 (26)
By: Dr. Basant Agarwal
Buy this Book

Overview of this book

Choosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You’ll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer. By the end of this Python book, you’ll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications.
Table of Contents (17 chapters)
close
close
close
Preface
Icon
Preface
Icon
Who this book is for
Icon
What this book covers
Icon
To get the most out of this book
Icon
Get in touch
Lock Free Chapter
1
Python Data Types and Structures
Icon
Python Data Types and Structures
Icon
Introducing Python 3.10
Icon
Installing Python
Icon
Setting up a Python development environment
Icon
Overview of data types and objects
Icon
Basic data types
Icon
Complex data types
Icon
Python’s collections module
Icon
Summary
2
Introduction to Algorithm Design
Icon
Introduction to Algorithm Design
Icon
Introducing algorithms
Icon
Performance analysis of an algorithm
Icon
Asymptotic notation
Icon
Amortized analysis
Icon
Composing complexity classes
Icon
Computing the running time complexity of an algorithm
Icon
Summary
Icon
Exercises
3
Algorithm Design Techniques and Strategies
Icon
Algorithm Design Techniques and Strategies
Icon
Algorithm design techniques
Icon
Recursion
Icon
Divide and conquer
Icon
Dynamic programming
Icon
Greedy algorithms
Icon
Summary
Icon
Exercises
4
Linked Lists
chevron up
Icon
Linked Lists
Icon
Arrays
Icon
Introducing linked lists
Icon
Singly linked lists
Icon
Doubly linked lists
Icon
Circular lists
Icon
Practical applications of linked lists
Icon
Summary
Icon
Exercise
5
Stacks and Queues
Icon
Stacks and Queues
Icon
Stacks
Icon
Queues
Icon
Summary
Icon
Exercises
6
Trees
Icon
Trees
Icon
Terminology
Icon
Binary trees
Icon
Binary search trees
Icon
Summary
Icon
Exercises
7
Heaps and Priority Queues
Icon
Heaps and Priority Queues
Icon
Heaps
Icon
Priority queues
Icon
Summary
Icon
Exercises
8
Hash Tables
Icon
Hash Tables
Icon
Introducing hash tables
Icon
Resolving collisions
Icon
Implementing hash tables
Icon
Symbol tables
Icon
Summary
Icon
Exercise
9
Graphs and Algorithms
Icon
Graphs and Algorithms
Icon
Graphs
Icon
Graph representations
Icon
Graph traversals
Icon
Other useful graph methods
Icon
Summary
Icon
Exercises
10
Searching
Icon
Searching
Icon
Introduction to searching
Icon
Linear search
Icon
Jump search
Icon
Binary search
Icon
Interpolation search
Icon
Exponential search
Icon
Choosing a search algorithm
Icon
Summary
Icon
Exercise
11
Sorting
Icon
Sorting
Icon
Technical requirements
Icon
Sorting algorithms
Icon
Bubble sort algorithms
Icon
Insertion sort algorithm
Icon
Selection sort algorithm
Icon
Quicksort algorithm
Icon
Implementation of quicksort
Icon
Timsort algorithm
Icon
Summary
Icon
Exercise
12
Selection Algorithms
Icon
Selection Algorithms
Icon
Technical requirements
Icon
Selection by sorting
Icon
Randomized selection
Icon
Deterministic selection
Icon
Summary
Icon
Exercise
13
String Matching Algorithms
Icon
String Matching Algorithms
Icon
Technical requirements
Icon
String notations and concepts
Icon
Pattern matching algorithms
Icon
The brute force algorithm
Icon
The Rabin-Karp algorithm
Icon
The Knuth-Morris-Pratt algorithm
Icon
The Boyer-Moore algorithm
Icon
Summary
Icon
Exercise
14
Other Books You May Enjoy
Icon
Other Books You May Enjoy
15
Index
Icon
Index
1
Appendix: Answers to the Questions
Icon
Chapter 2: Introduction to Algorithm Design
Icon
Chapter 3: Algorithm Design Techniques and Strategies
Icon
Chapter 4: Linked Lists
Icon
Chapter 5: Stacks and Queues
Icon
Chapter 6: Trees
Icon
Chapter 7: Heaps and Priority Queues
Icon
Chapter 8: Hash Tables
Icon
Chapter 9: Graphs and Algorithms
Icon
Chapter 10: Searching
Icon
Chapter 11: Sorting
Icon
Chapter 12: Selection Algorithm
Icon
Chapter 13: String Matching Algorithms

Exercise

  1. What will be the time complexity when inserting a data element after an element that is being pointed to by a pointer in a linked list?
  2. What will be the time complexity when ascertaining the length of the given linked list?
  3. What will be the worst-case time complexity for searching a given element in a singly linked list of length n?
  4. For a given linked list, assuming it has only one head pointer that points to the starting point of the list, what will be the time complexity for the following operations?
    1. Insertion at the front of the linked list
    2. Insertion at the end of the linked list
    3. Deletion of the front node of the linked list
    4. Deletion of the last node of the linked list
  5. Find the nth node from the end of a linked list.
  6. How can you establish whether there is a loop (or circle) in a given linked list?
  7. How can you ascertain the middle element of the linked list?

Join...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Hands-On Data Structures and Algorithms with Python – Third Edition
End of Chapter 4
Next Chapter
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon