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.About the Author
R. Panneerselvam, PhD, is currently Professor, Department of Management Studies, School of Management, Pondicherry University, Puducherry. He has three decades of teaching and research experience, which includes his teaching of engineering students at Anna University, Chennai. He is the recipient of Academic Excellence Award in an International Conference on Advances in Industrial Engineering Practices (2010).
Author of nine books (all published by PHI Learning), Professor Panneerselvam has to his credit about 80 research articles in national and international journals. He has also carried out overseas consultancy.
