Amazon cover image
Image from Amazon.com

Design and analysis of algorithms / I. Chandra Mohan.

By: Material type: TextTextPublication details: New Delhi, India : PHI Learning Private Limited, c2012Edition: Second editionDescription: xiii, 186 pages : illustrations ; 24 cmISBN:
  • 9788120345751
Subject(s): LOC classification:
  • QA 76.9.A43 .M64 2012
Contents:
1, Fundamentals -- 2. Divide-and-Conquer Methods -- 3. The Greedy Method -- 4. Set Manipulation Algorithms -- 5. Dynamic Programming -- 6. Search and Traversal Techniques -- 7. Backtracking Methods -- 8. Branch-and-Bound Methods -- 9. Algebraic Simplification and Transformation -- 10. Lower Boundary Theory and NP-Hard and NP-Complete Problems -- References -- Index.
Summary: This book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new materials. It discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Computer Science GC QA 76.9.A43 .M64 2012 (Browse shelf(Opens below)) c.1 Available NULIB000006711

Includes index.

1, Fundamentals -- 2. Divide-and-Conquer Methods -- 3. The Greedy Method -- 4. Set Manipulation Algorithms -- 5. Dynamic Programming -- 6. Search and Traversal Techniques -- 7. Backtracking Methods -- 8. Branch-and-Bound Methods -- 9. Algebraic Simplification and Transformation -- 10. Lower Boundary Theory and NP-Hard and NP-Complete Problems -- References -- Index.

This book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new materials. It discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.

There are no comments on this title.

to post a comment.