Design and Analysis of Algorithms

V.V. Muniswamy

ISBN: 9789389520507

272 pages

INR 405


This book is designed for the way we learn and intended for one-semester course in “Design and Analysis of Algorithms”. This is a very useful guide for graduate and undergraduate students and teachers of computer science. This book provides a coherent and pedagogically sound framework for learning and teaching. Its breadth of coverage insures that algorithms are carefully and comprehensively discussed with figures and tracing of algorithms. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors’ flexibility and allowing them to use the text as lecture reinforcement.



  1. Introduction to Algorithms
  2. Disjoint Sets
  3. Divide and Conquer
  4. Greedy Method
  5. Dynamic Programming
  6. Backtracking
  7. Branch and Bound
  8. NP-Complete Problems





  • Name:
  • Designation:
  • Name of Institute:
  • Email:
  • * Request from personal id will not be entertained
  • Moblie:
  • ISBN / Title:
  • ISBN:    * Please specify ISBN / Title Name clearly