Hands-On Data Structures and Algorithms with Python: Store, manipulate, and access data effectively and boost the performance of your applications, 3rd Edition Paperback – 29 July 2022
Thumbnail 1

Hands-On Data Structures and Algorithms with Python: Store, manipulate, and access data effectively and boost the performance of your applications, 3rd Edition Paperback – 29 July 2022

4.6/5
Product ID: 420221967
Secure Transaction

Description

Full description not available

Large manufacture image 1
Small manufacture image 1Small manufacture image 2Small manufacture image 3

Reviews

4.6

All from verified purchases

S**G

Great book with each topic covered thoroughly, precisely and to the point. Highly recommended!

This book has helped me to learn about different algorithms, how they work and the data structures needed to make these algorithms efficient. Each topic is covered thoroughly, precisely and to the point. This book would be useful for prep for technical interviews and for University algorithm classes. Highly recommended!

N**B

a good book to start with Data Structures and Algorithms for beginners

This book gives a good overview of the python with respect to data structures and algorithms. The book is organized well with the sections and chapters. Sections on algorithm and time complexity were also good. But the only drawback was that the examples for certain sections were limited to simple examples. So a bit more practical and complex examples would have given readers a better understanding on how it can be used in real world.For a someone who is beginner in the field of Data structures and algorithms, this book would be very beneficial as it covers a lot of ground with good examples, neat diagrams and example code. Intermediate and advanced users might find it a bit short on details.

S**N

The Special Bumper Price for Python Lovers (New and Existing Software Engineers)

Always performance is the key factor for any domain irrespective of nature, specifically in the IT industry the performance of the system depends upon the efficient access and retrieval of the data, and that depends upon how well the data structures that store and organize the data in the system are chosen.Better choice of “Store, Manipulate, and Access data” are effective and boosting the performance of your applications is a major goal and objective. Remember that all the factors which are mentioned above are pertaining to data structure and algorithms built for project or product requirements.An algorithm can be defined as a set of step-by-step instructions to solve any given problem; an algorithm processes the data and produces the output results based on the specific problem.The data used by the algorithm to solve the problem has to be stored and organized efficiently in the computer memory for the efficient implementation of the software.The performance of the system depends upon the efficient access and retrieval of the data, and that depends upon how well the data structures that store and organize the data in the system are chosen.As we know that the Python programming language is a high-level, interpreted, and object-oriented language, a robust, powerful, and widely used language to develop software-based systems. Moreover, this is a suitable language to learn and understand the concepts of data structures and algorithms.To emphasize all these advantages and guide the attributes in the right direction for a better understanding point of view, the author put up his honest effort and described in thirteen chapters very precisely for the readers. I got an opportunity to read end-to-end and enjoyed it completely.Let me share my observations from this book chapter-wise.Chapter 1-5: The author kick starts with the introduction of Python and all necessary the basic concepts with simple examples right from data types and objects, the list of quite big and mandatory for beginners. Followed by feeding the algorithm design approaches along with the amount of time required to execute each line of code explains are really bringing the attention of learners to understand the importance of designing the algorithm and deriving them in the appropriate direction. The author’s note on “Worst-Case Running Time”, “Average-Case Running Time” and “Best-Case Running Time” is impressive. Discussion on various Notations [Asymptotic notation, Theta notation, Big O notation] is really a value-addition to understanding the mathematical core behind the scenes is a notable one.Everyone must read the topic “Algorithm Design Techniques and Strategies” without fail I would say. Each and every technique is explained well in a structured way along with neat sketches and examples. [Recursion, Divide and Conquer, Dynamic programming, Greedy algorithms]. My favourite is always Dynamic programming. I must recommend that new programmers should read this chapter and digest this space in the first place before start building the modules.Coming to efficient storage of data, the author has provided very exclusive content from Linked-Lists, Stacks and Queues with are amazing and deriving astonishing insights with crystal clear pictorial representation and sample code is a great power pack to understand these very complex topics, it is a great effort.Chapter 6-13: From Chapter 6, the author driving towards us into the advanced topics and here he has carefully guided the reader by comparing the concepts which were discussed in earlier chapters and feeding various Tree, and its concepts and nut and bolts of the same and connecting the dots along with algorithms and how we’re building the modules and high-performance solutions.Heaps and Priority Queues and Hash Tables ideas are clearly lined up and discussed with the various design considerations. I could see the author has given one- more best in this book is dealing with specialized structures like Graphs and Algorithms that are useful for constructing complex business solutions. Along with he has outlined Minimum Spanning Tree (MST), Kruskal’s Minimum and Prim’s Minimum Spanning Tree algorithms are special bounces for readers. On top author has offered exclusive and extensive techniques which come around 10+ count algorithms under (SSS) Searching, Sorting and Selection algorithms.Don’t forget to read the final chapter “String Matching Algorithms” - Brute Force Algorithm, Rabin-Karp, Knuth-Morris-Pratt (KMP), Boyer-Moore pattern matching algorithms with special sketches and content from the author is massive finishing by the excellent book. One more thing you must try the exercise to rate your understanding after reading every chapter.Overall, this book is the Special Bumper Price for Python Lovers (New and Existing Software Engineers)All the best to the author. Overall, I can give 4.0/5.0 for this. Certainly, we appreciate his special effort surely this book would make much significant impact on the readers.-Shanthababu PandianArtificial Intelligence and Analytics | Cloud Data and ML Architect | Scrum MasterNational and International Speaker | Blogger

Common Questions

Trustpilot

TrustScore 4.5 | 7,300+ reviews

Sneha T.

Received my product in pristine condition. Great service overall.

1 month ago

Farhan Q.

The delivery time was excellent, and the packaging was secure.

2 months ago

Shop Global, Save with Desertcart
Value for Money
Competitive prices on a vast range of products
Shop Globally
Serving millions of shoppers across more than 100 countries
Enhanced Protection
Trusted payment options loved by worldwide shoppers
Customer Assurance
Trusted payment options loved by worldwide shoppers.
Desertcart App
Shop on the go, anytime, anywhere.
£46.00

Duties & taxes incl.

UKstore
1
Free Shipping

with PRO Membership

Free Returns

30 daysfor PRO membership users

15 dayswithout membership

Secure Transaction

Trustpilot

TrustScore 4.5 | 7,300+ reviews

Suresh K.

Very impressed with the quality and fast delivery. Will shop here again.

4 days ago

Fatima A.

Best international shipping I've ever tried. Worth every penny!

3 days ago

Hands On Data Structures And Algorithms With Python Store Manipulate | Desertcart GB