Design Methods And Analysis Of Algorithms by S. K. Basu
Book Summary:
The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialized, teaches the skills needed to master the essentials of this subject. With clear explanations and engaging writing style, the book places increased emphasis on algorithm design techniques rather than programming in order to develop in the reader the problem-solving skills.
The treatment throughout the book is primarily tailored to the curriculum needs of B.Tech. students in computer science and engineering, B.Sc. (Hons.) and M.Sc. students in computer science, and MCA students.
The book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a reader-friendly text. Elementary analysis of time complexities is provided for each example-algorithm. A varied collection of exercises at the end of each chapter serves to reinforce the principles/methods involved.
Audience of the Book :
This book Useful for engineering, MCA & M.Sc Student.
Table of Contents:
1. Computational Models
2. Basics of Algorithm
3. Divide and Conquer
4. Greedy Method
5. Dynamic Programming
6. Further Divide and Conquer
7. A Bit of Theory
8. Approximation Algorithms
9. Randomized Algorithms
10. Graph Algorithms
11. Backtracking, Branch and Bound
12. Lower Bound Techniques
13. Genetic Algorithms
14. Parallel Algorithms
15. Bioinformatics Algorithms
16. Conclusion
Appendix
Bibliography
Index