Amazon cover image
Image from Amazon.com

Algorithm analysis and design / Deepack Gupta

By: Material type: TextTextPublication details: New Delhi, India : For S.K. Kataria & Sons, c2012Edition: Second editionDescription: 330 pages : illustrations ; 24 cmISBN:
  • 9789350141182
Subject(s): LOC classification:
  • QA 76.9.A43 .G87 [2012]
Contents:
1. Introduction -- 2. Growth of Functions -- 3. Recurrences -- 4. Divide and Conquer -- 5. Medians and Oder Statistics -- 6. Data Structures for Disjoint Sets -- 7. Dynamic Programming -- 8. Greedy Method -- 9. Graphs -- 10. String Matching -- 11. NP Complete -- Appendix -- Model Test Papers -- Examination Papers -- Index.
Summary: It gives me great pleasure in presenting the second edition of this book to our esteemed and honorable students. Algorithms Analysis and Design is a very popular, strong and challenging subject which is commonly used by Scientists & Engineers to analysis the total running time for any programs or algorithm written for system and advance applications.
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 Gen. Ed. - CCIT GC QA 76.9.A43 .G87 [2012] (Browse shelf(Opens below)) c.1 Available NULIB000007040

Includes index.

1. Introduction -- 2. Growth of Functions -- 3. Recurrences -- 4. Divide and Conquer -- 5. Medians and Oder Statistics -- 6. Data Structures for Disjoint Sets -- 7. Dynamic Programming -- 8. Greedy Method -- 9. Graphs -- 10. String Matching -- 11. NP Complete -- Appendix -- Model Test Papers -- Examination Papers -- Index.

It gives me great pleasure in presenting the second edition of this book to our esteemed and honorable students. Algorithms Analysis and Design is a very popular, strong and challenging subject which is commonly used by Scientists & Engineers to analysis the total running time for any programs or algorithm written for system and advance applications.

There are no comments on this title.

to post a comment.