Algorithm Design Techniques

Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming

By: Narasimha Karumanchi

Write A Review

Paperback | 1 January 2018

At a Glance

Paperback
490 Pages

Dimensions(cm)
22.86 x 15.24 x 2.77

Paperback

$80.75

or 4 interest-free payments of $20.19 with

Ships in 10 to 15 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $49.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.