Book Image

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

By : Dr. Basant Agarwal
Book Image

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

By: Dr. Basant Agarwal

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)
Other Books You May Enjoy


  1. What is the maximum number of edges (without self-loops) possible in an undirected simple graph with five nodes?
  2. What do we call a graph in which all the nodes have equal degrees?
  3. Explain what cut vertices are and identify the cut vertices in the given graph:

Figure 9.39: A sample graph

  1. Assuming a graph G of order n, what will be the maximum number of cut vertices possible in graph G?

Join our community on Discord

Join our community’s Discord space for discussions with the author and other readers: