Picture 1 of 2

Stock photo

Data Structure and Algorithmic Thinking with Python by Karumanchi, Narasimha - Picture 1 of 2

Data Structure and Algorithmic Thinking with Python by Karumanchi, Narasimha - Picture 2 of 2

Data Structure and Algorithmic Thinking with Python by Narasimha Karumanchi (Paperback, 2015)

loveourprices2 (118652)

96% positive Feedback

Price:

£38.46

Free postage

Estimated delivery Thu, 14 Aug

Returns:

60 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

Narasimha Karumanchi is the founder of CareerMonk Publications and author of few books on data structures, algorithms, and design patterns. He was a software developer who has been both interviewer and interviewee over his long career.

About this product

Product Information

It is the Python version of Data Structures and Algorithms Made Easy . Table of Contents: goo.gl/VLEUca Sample Chapter: goo.gl/8AEcYk Source Code: goo.gl/L8Xxdt The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex problems in data structures and algorithm. It even provides multiple solutions for a single problem, thus familiarizing readers with different possible approaches to the same problem. Data Structure and Algorithmic Thinking with Python is designed to give a jump-start to programmers, job hunters and those who are appearing for exams. All the code in this book are written in Python. It contains many programming puzzles that not only encourage analytical thinking, but also prepares readers for interviews. This book, with its focused and practical approach, can help readers quickly pick up the concepts and techniques for developing efficient and effective solutions to problems. Topics covered include: Organization of Chapters Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queues and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Hacks on Bit-wise Programming Other Programming Questions