Design and Analysis of Algorithms is designed to serve as a textbook for the undergraduate students of computer science engineering and information technology as well as postgraduate students of computer applications. The book aims to empower students with in-depth knowledge of the fundamental concepts and the design, analysis, and implementation aspects of algorithms. The book begins with the basics of algorithms and problem-solving concepts followed by an introduction to algorithm writing, and analysis of iterative and recursive algorithms. In-depth explanations and designing techniques of various types of algorithms used for problem-solving such as brute force technique, divide-and-conquer technique, decrease-and-conquer strategy, greedy approach, transform-and-conquer strategy, dynamic programming, branch-and-bound approach, and backtracking are provided in the book. It also covers discussion of string algorithms, iterative improvement, linear programming, computability theory, NP-hard problems, NP- completeness, randomized algorithms, approximation algorithms, and parallel algorithms. The book includes a variety of chapter-end pedagogical features such as point-wise summary, glossary, review questions, exercises, and additional problems to help readers test their understanding and also apply and practise the concepts learnt. Appendices on basic mathematics and proof techniques are given to aid students refresh the fundamental concepts.