Design and Analysis of Algorithms – 2 Edition

The second edition of Design and Analysis of Algorithms is an essential textbook for undergraduate and postgraduate students in computer science and information technology. This book is useful for other engineering branch students who opt for algorithms courses, diploma students and postgraduate students in computer applications. The book is also useful for competitive examinations like GATE and useful for coding interviews. Its primary goal is to equip students with comprehensive knowledge of fundamental concepts related to algorithm design, analysis and implementation aspects of algorithms. The book begins with exploring algorithm basics and problem-solving concepts and then introduces topics like algorithm writing and analyses iterative and recursive algorithms. It provides detailed explanations and design techniques, including brute force, divide-and-conquer, decrease-and-conquer, greedy approach, transform-and-conquer, dynamic programming, branch-and-bound, backtracking and Iterative development. Moreover, the book delves into string algorithms, data structures, linear programming, computability theory, NP-hard problems, NP-completeness, randomized algorithms, approximation algorithms, and parallel algorithms, offering a well-rounded and comprehensive coverage of essential topics. The book includes various chapter-end pedagogical features such as point-wise summary, glossary, review questions, exercises, crosswords and additional problems to help readers test their understanding and apply and practice the concepts learnt. Appendices on basic mathematics and proof techniques are given to aid students in refreshing the fundamental concepts.

Key Features

  • In-depth treatment for topics such as divide and conquer, greedy approach, dynamic programming, transform-and-conquer technique, decrease-and-conquer technique, linear programming, and randomized and approximation algorithms.
  • Extensive discussion on computational skills algorithm writing and analysis of iterative and recursive algorithms
  • Extensive discussion on the developing and designing aspects of algorithms using minimal mathematics
  • Numerous examples to assist understanding of the concepts
  • Judicious presentation of algorithms using a stepwise approach throughout the text
  • Historical notes on various topics and chapter-end crossword puzzles to engage readers and enhance their interest in the subject

New to the 2Ed

  • Laboratory manual involving Python
  • Selected implementation of algorithms in Python
  • Addition of like computational skills, Recurrence equations, B-Trees and other data structures
  • Complete rewriting of selected chapters to give more clarity
  • Additional problems to promote exponential seaming


Total Page Visits: 6566 - Today Page Visits: 8

Leave a Reply

Your email address will not be published. Required fields are marked *