000 | 02283nam a2200229Ia 4500 | ||
---|---|---|---|
003 | NULRC | ||
005 | 20250520100607.0 | ||
008 | 250520s9999 xx 000 0 und d | ||
020 | _a9788190856539 | ||
040 | _cNULRC | ||
050 | _aQA 76.9.A43 .G69 2010 | ||
100 |
_aGoyal, Sachin Dev. _eauthor |
||
245 | 0 |
_aDesign and analysis of algorithm / _cSachin Dev Goyal. |
|
260 |
_aBangalore, India : _bUniversity Science Press, _cc2010 |
||
300 |
_axi, 445 pages : _billustrations ; _c24 cm. |
||
365 | _bUSD22.38 | ||
504 | _aIncludes index. | ||
505 | _aChapter 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. | ||
520 | _aThe 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. | ||
650 | _aCOMPUTER ALGORITHM | ||
942 |
_2lcc _cBK |
||
999 |
_c8951 _d8951 |