Design and analysis of algorithm / Sachin Dev Goyal.
Material type:
- 9788190856539
- QA 76.9.A43 .G69 2010

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.A43 .G69 2010 (Browse shelf(Opens below)) | c.1 | Available | NULIB000006710 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
No cover image available |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.9 .S76 1990 High-performance computer architecture : solution Manual / | GC QA 76.9.A25 .B73 2018 Hands-on perpetration testing on windows : unleash Kali Linux, PowerShell and windows debugging tools for security testing and analysis / | GC QA 76.9.A25 .C65 2011 Computer forensics jumpstart / | GC QA 76.9.A43 .G69 2010 Design and analysis of algorithm / | GC QA 76.9.A43 .L48 2012 Introduction to the design and analysis of algorithms / | GC QA 76.9.A43 .M55 2013 Algorithms sequential and parallel : a unified approach / | GC QA 76.9.A43 .M64 2012 Design and analysis of algorithms / |
Includes index.
Chapter 1. Role of Algorithm -- Chapter 2. Growth of Functions -- Chapter 3. Recurrences -- Chapter 4. Heap Sort -- Chapter 5. Quick Sort -- Chapter 6. Sorting in Linear Time --Chapter 7. Medians and Order Statistics --Chapter 8. Elementary Data Structures -- Chapter 9. Hash Table -- Chapter 10. Binary Search Tree (BST) -- Chapter 11. Red-Black Trees -- Chapter 12. Augmenting Data Structures -- Chapter 13. Splay Trees -- Chapter 14. B-Trees -- Chapter 15. Binomial Heaps -- Chapter 16. Fibonacci Heaps -- Chapter 17. Data Structures for Disjoint Sets -- Chapter 18. Dynamic Programming -- Chapter 19. Greedy Algorithms -- Chapter 20. Amortized Analysis --Chapter 21. Branch and Bound -- Chapter 22. Backtracking -- Chapter 23. Elementary Graph Algorithms -- Chapter 24. Minimum Spanning Tree -- Chapter 25. Single-Source Shortest Paths -- Chapter 26. All Pairs Shortest Paths -- Chapter 27. Maximum Flow -- Chapter 28. Sorting Networks -- Chapter 29. Matrix Operations -- Chapter 30. Polynomials and the FFT -- Chapter 31. Number-Theoretic Algorithms -- Chapter 32. String Matching -- Chapter 33. Computational Geometry -- Chapter 34. NP-Completeness -- Chapter 35. Approximation Algorithm -- Model Question Paper -- Question Bank -- Previous Year Question Paper -- Index.
The motivate behind this book is to provide an introduction to the subject of Design and Analysis of Algorithm. Algorithm concepts have been presented in a simple and logical manner keeping the essence and flavour of rigour in fact. To familiarize the reader with the application of basic concepts, a selective sprinkling of illustrative examples is incorporated in the text.
There are no comments on this title.