Press Ctrl+G to toggle between English & Hindi
0 Ratings
0 Reviews
264 Views
The design of correct and efficient algorithm for problem solving lies at the heart of computer science. This concise text, with ought being highly sp .... Read More
The design of correct and efficient algorithm for problem solving lies at the heart of computer science. This concise text, with ought being highly specialized teaches the skills needed to master the essential of this subject with clear explanation and engaging writing style, the book place increased emphasis on algorithm design techniques rather than programming in order to develop in the reader the problem-solving skills.
| Sr | Chapter Name | No Of Page |
|---|---|---|
| 1 | 1. ROLE OF ALGORITHM | 8 |
| 2 | 2. GROWTH OF FUNCTIONS | 19 |
| 3 | 3. SUMMATIONS | 4 |
| 4 | 4. RECURRENCES | 24 |
| 5 | 5. ANALYSIS OF SORTING ALGORITHMS | 14 |
| 6 | 6. HEAPSORT | 20 |
| 7 | 7. QUICK SORT | 12 |
| 8 | 8. SORTING IN LINEAR TIME | 13 |
| 9 | 9. MEDIANS AND ORDER STATISTICS | 4 |
| 10 | 10. HASING | 10 |
| 11 | 11. ELEMENTARY DATA STRUCTURES | 6 |
| 12 | 12. BINARY SEARCH TREE | 8 |
| 13 | 13. AVL TREES AND SPLAYING | 10 |
| 14 | 14. RB-TREES | 19 |
| 15 | 15. AUGMENTING DATA STRUCTURES | 8 |
| 16 | 16. B-TREES | 14 |
| 17 | 17. BINOMIAL HEAPS | 17 |
| 18 | 18. FIBONACCI HEAPS | 16 |
| 19 | 19. DATA STRUCTURE FOR DISJOINT SETS | 5 |
| 20 | 20. DYNAMIC PROGRAMMING | 16 |
| 21 | 21. GREEDY ALGORITHMS | 18 |
| 22 | 22. BACKTRACKING | 16 |
| 23 | 23. BRANCH AND BOUND | 6 |
| 24 | 24. AMORTIZED ANALYSIS | 8 |
| 25 | 25. ELEMENTARY GRAPH ALGORITHMS | 11 |
| 26 | 26. MINIMUM SPANNING TREE | 11 |
| 27 | 27. SINGLE SOURCE SHORTEST PATHS | 14 |
| 28 | 28. ALL PAIRS SHORTEST PATHS | 13 |
| 29 | 29. MAXIMUM FLOW | 11 |
| 30 | 30. SORTING NETWORK | 5 |
| 31 | 31. MATRIX OPERATIONS | 11 |
| 32 | 32. NUMBER THEORETIC ALGORITHMS | 5 |
| 33 | 33. POLYNOMIALS AND FFT | 6 |
| 34 | 34. STRING MATCHING | 20 |
| 35 | 35. NP-COMPLETENESS | 10 |
| 36 | 36. APPROXIMATION ALGORITHM | 10 |
Thank you for sharing the details. Your enquiry has been submitted successfully. We will contact you soon.