Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming, Paperback/Narasimha Karumanchi

Descriere

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. What's Inside Enumeration of possible solutions for the problems. Performance trade-offs (time and space complexities) between the algorithms. Covers interview questions on data structures and algorithms. All the concepts are discussed in a lucid, easy to understand manner. Interview questions collected from the actual interviews of various software companies will help the students to be successful in their campus interviews. Python-based code samples were given the book. About the Author: Narasimha Karumanchi is the founder of Career Monk Publications and author of a 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 a M. Tech. degree in computer science from IIT, Bombay, and B. Tech. from JNT university. He authored the following books which got translated to multiple international languages: Chinese, Japanese, Korea and Taiwan. Also, around 72 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 Structures and Algorithmic Thinking with Python Algorithm Design Techniques