Design and Analysis of Algorithms This book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new material. It 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. The book begins with an introduction to algorithm analysis and then presents different methods and techniques-divide and conquer methods, the greedy method, search and traversal techniques, backtracking methods, branch and bound methods-used in the design of algorithms. Each algorithm that is written in this book is followed first by a detailed explanation and then is supported by worked-out examples. The book contains a number of figures to illustrate the theoretical aspects and also provides chapter-end questions to enable students to gauge their understanding of the underlying concepts. What distinguishes the text is its compactness, which has been achieved without sacrificing essential subject matter. About the Author: I. Chandra Mohan I. Chandra Mohan, M.Sc., Ph.D., was Professor and Head, Department of Mathematics, S.V. University, Tirupati. He has over three decades of teaching experience in the fields of Computer Science and Computer Applications. During this period, he has guided a number of advanced students of these fields in their Ph.D. and M.Phil. level studies and research.