9788193245255

Algorithm Design Techniques

Format: Paperback

ISBN13: 9788193245255

Paperback|9788193245255

Featured Offer

Brand New

$33.72

List Price: $39.99

🚚

FREE standard delivery by: 25 Aug 2025

See all 5 offers from $33.72

Overview

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic ProgrammingAlgorithm 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 InsideEnumeration 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.


ISBN-13

9788193245255

ISBN-10

8193245253

Weight

1.68 Pounds

Dimensions

7.00 x 1.10 x 10.00 In

List Price

$39.99

Format

Paperback

Language

English

Pages

552 pages

Publisher

CareerMonk Publications

Published On

2018-01-01



View All Offers

Sort by:

Rows per page:

1–5 of 5

Condition
Seller
Seller Comments
Price
Brand New
Seller details
Media Smart

Hawthorne, CA, USA

$33.72

 Free delivery by: 25 Aug 2025

Brand New
Seller details
Alibris

Sparks, NV, USA

Print on demand Trade paperback (US). Glued binding. 490 p.
$38.30

 Free delivery by: 25 Aug 2025

Brand New
Seller details
Paperbackshop

Bensenville, IL, USA

New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot of...
$54.38

 Free delivery by: 25 Aug 2025

Used, Good
Seller details
Bonita

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$68.94

 Free delivery by: 25 Aug 2025

Brand New
Seller details
Bonita

Santa Clarita, CA, USA

$101.35

 Free delivery by: 25 Aug 2025