Primarily designed as a text for undergraduate students of computer science and engineering and information technology, and postgraduate students of computer applications, the book will also be useful to postgraduate students of computer science and IT (M.Sc., Computer Science; M.Sc., IT). The objective of this book is to expose students to basic techniques in algorithm design and analysis. This well organised text provides the design techniques of algorithms in a simple and straightforward manner. Each concept is explained with an example that helps students to remember the algorithm devising techniques and analysis. The text describes the complete development of various algorithms along with their pseudo-codes in order to gain an understanding of their applications. It also discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones. Key FeaturesRandomised and approximation algorithms are explained well to reinforce understanding of the subject matter. Various methods for solving recurrences are well explained with examples. NP-completeness of various problems are proved with simple explanations.
