Data Structure and Algorithmic Thinking with Python: Data Structure and Algorithmic Puzzles

Karumanchi, Narasimha

ISBN 10: 8192107590 / ISBN 13: 9788192107592

Published by CareerMonk Publications, 2015

About this Item

Softcover. Previous owner name atop first page. Main body of text features Clean text - NO writing, NO highlighting. Touch of wear to cover with a couple of creases. First few pages lightly creased. Good+ and useful reading copy. Oversized. Clean text -- NO writing, NO highlighting to text.ÂPLEASE NOTE: Domestic US media (standard) US orders ONLY. NO international orders.

Seller Inventory # mon0000223449

Bibliographic Details

• Title: Data Structure and Algorithmic Thinking with Python: Data Structure and Algorithmic Puzzles
• Publisher: CareerMonk Publications
• Publication Date: 2015
• Language: English
• ISBN 10: 8192107590
• ISBN 13: 9788192107592
• Binding: paperback
• Condition: Good

About this title

Synopsis

 Peeling Data Structures and Algorithms:

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:

• Organization of chapters
• Introduction
• Recursion and Backtracking
• Linked Lists
• Stacks
• Queues
• Trees
• Priority Queue 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   
• Miscellaneous Concepts   

About the Author

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. Most recently he worked for Amazon Corporation, IBM Software Labs, Mentor Graphics, and Microsoft. Narasimha holds an M.Tech. in computer science from IIT, Bombay, and B.Tech. from JNT university. He authored the following books which got translated to international languages: Chinese, Japanese, Korea and Taiwan. Also, around 58 international universities were using these books as reference for academic courses.

• Data Structures and Algorithms Made Easy
• IT Interview Questions
• Data Structures and Algorithms for GATE
• Data Structures and Algorithms Made Easy in Java
• Coding Interview Questions
• Peeling Design Patterns
• Elements of Computer Networking
• Data Structure and Algorithmic Thinking with Python
• Algorithm Design Techniques