Design and Analysis of Algorithms/ By S. Sridhar.
Material type:
TextPublication details: New Delhi: Oxford University Press, 2024.Edition: 2nd EdDescription: xiv, 680p;, 24cmISBN: - 9789354977886
- 23rd Ed. 005.1 SRI
| Item type | Current library | Collection | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
Central Library GS Collection | Computer Science | 005.1 SRI (Browse shelf(Opens below)) | Available | 8705 | ||
|
Books
|
Central Library GS Collection | Computer Science | 005.1 SRI (Browse shelf(Opens below)) | ;1 | Available | 8706 |
Browsing Central Library shelves,Shelving location: GS Collection,Collection: Computer Science Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 004 THA Fundamentals of Computers/ | 004.65 TRI Data Communication and Networks/ | 004.65 TRI Data Communication and Networks/ | 005.1 SRI Design and Analysis of Algorithms/ | 005.1 SRI Design and Analysis of Algorithms/ | 005.13 LAN R for Everyone: Advanced Analytics and Graphics/ | 005.13 LAN R for Everyone: Advanced Analytics and Graphics/ |
Contents:
1. Introduction to Algorithms.
2. Basics of Algorithms Writing.
3. Basics of Algorithms Analysis.
4. Mathematical Analysis of Recursive Algorithms.
5. Data Structures - I
6. Data Structures - II
7. Brute Force Approaches.
8. Divide and Conquer Approach.
9. Decrease and Conquer Approach.
10. Time Space Tradeoffs.
11. Greedy Algorithms.
12. Transform and Conquer Approach.
13. Dynamic Programming.
14. Backtracking.
15. Branch and Bound Technique.
16. String Algorithms.
17. Iterative Improvement and Linear Programming.
18. Basics of Computational Complexity.
19. Randomized Algorithms.
20. Approximation Algorithms.
21. Parallel Algorithms.
Includes:
1. Appendix A
2. Appendix B
3. Appendix C
4. Appendix D
5. Appendix E
6. Bibliography.
7. Index.
There are no comments on this title.