Analysis and design of algorithms / Amrinder Arora
Material type:
- 9781634870214
- QA 76.9 .A76 2015

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.9 .A76 2015 (Browse shelf(Opens below)) | c.1 | Available | NULIB000013759 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
No cover image available |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.8.M3 .D55 1991 Reference guide to your Macintosh / | GC QA 76.9 .A45 2010 Visual Basic and Access : visual guide / | GC QA 76.9 .A45 2017 Advanced penetration testing : hacking the world's most secure networks / | GC QA 76.9 .A76 2015 Analysis and design of algorithms / | GC QA 76.9 .B46 2014 A guide to algorithm design : paradigms, methods, and complexity analysis / | GC QA 76.9 .C66 2010 Database systems : a practical approach to design, implementation, and management / | GC QA 76.9 .C67 2011 Database Principles : fundamentals of design, implementation, and management / |
Includes bibliographical references.
Section I: The Basics -- Section II: Algorithm Design Techniques -- Section III: Intrinsic Hardiness of Problems -- Section IV: Conclusions and Auxiliary Materials.
Analysis and Design of Algorithms provides a structured view of algorithm design techniques in a concise, easy-to-read manner. The book was written with an express purpose of being easy — to understand, read, and carry. It presents a pioneering approach in the teaching of algorithms, based on learning algorithm design techniques, and not merely solving a collection of problems. This allows students to master one design technique at a time and apply it to a rich variety of problems. Analysis and Design of Algorithms covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques, there are templates and guidelines on when to use and not to use each technique. Many sections contain innovative mnemonics to aid the readers in remembering the templates and key takeaways. Additionally, the book covers NP-completeness and the inherent hardness of problems. The third edition includes a new section on polynomial multiplication, as well as additional exercise problems, and an updated appendix.
There are no comments on this title.