Design and Analysis of Algorithms (Paperback)

This highly structured text 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 application in practice.

With clear explanations, the book analyzes different kinds of algorithms such as distance-based network algorithms, search algorithms, sorting algorithms, probabilistic algorithms, and single as well as parallel processor scheduling algorithms. Besides, it discusses the importance of heuristics, benchmarking of algorithms, cryptography, and dynamic programming.

Key Features
* Offers in-depth treatment of basic and advanced topics.
* Includes numerous worked examples covering varied real-world situations to help students grasp the concepts easily.
* Provides chapter-end exercises to enable students to check their mastery of content.

This text is especially designed for students of B.Tech and M.Tech (Computer Science and Engineering and Information Technology), MCA, and M.Sc. (Computer Science and Information Technology). It would also be useful to undergraduate students of electrical and electronics and other engineering disciplines where a course in algorithms is prescribed.

Table of Contents
Preface
1. Introduction
2. Graphs
3. Data Structure
4. Distance-Based Network Algorithms
5. Search Algorithms
6. Sorting Algorithms
7. Heuristics
8. Meta-Heuristics
9. Cryptography
10. Probabilistic Algorithms
11. Dynamic Programming
12. Benchmarking Of Algorithms
13. Algorithms To Schedule Processor(S)
14. Miscellaneous Algorithms
Bibliography
Index