Design And Analysis Of Algorithms by R. Panneerselvam
Book Summary:
This highly structured text, in its second edition, provides comprehensive coverage of design techniques of algorithms. It traces the complete development of various algorithms in a stepwise approach followed by their pseudo-codes to build an understanding of their applications in practice. With clear explanations, the textbook intends to be much more comprehensive book on design and analysis of algorithm.
Commencing with the introduction, the book gives a detailed account of graphs and data structure. It then elaborately discusses the matrix algorithms, basic algorithms, network algorithms, sorting algorithm, backtracking algorithms and search algorithms. The text also focuses on the heuristics, dynamic programming and meta heuristics. The concepts of cryptography and probabilistic algorithms have been described in detail. Finally, the book brings out the underlying concepts of benchmarking of algorithms, algorithms to schedule processor(s) and complexity of algorithms.
Audience of the Book :
This book Useful for BCA, MCA, PGDCA, and DCA Student.
Table of Contents:
1. Introduction
2. Graphs
3. Data Structure
4. Matrix Algorithms
5. Basic Algorithms
6. Network Algorithms
7. Sorting Algorithm
8. Backtraking Algorithms
9. Search Algorithms
10. Heuristics
11. Dynamic Programming
12. Meta Heuristics
13. Cryptography
14. Probabilistic Algorithms
15. Benchmarking of Algorithms
16. Algorithms to Schedule Processor(s)
17. Complexity of Algorithms
Questions
Suggested Readings
Index