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.
Preface 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 AppendicesReferences Index
V.V. Muniswamy :- V.V. Muniswamy was Professor of Industrial Engineering and Computer Science at Sri Venkateswara University (SVU). He received his B.E. and M. Tech from SVU, Tirupati-AP and Ph.D. in Computer Simulation Modeling from Indian Institute of Technology (IIT), Madras. Dr. Swamy’s computer software experience started in 1975 from IBM Mainframe in IIT (through punched cards) to PCs and Client-Server Systems. He is the first person to create computer awareness in SVU. He worked as an SAP consultant in the USA from 1997 to 2003. He has been involved in teaching and curriculum development in academic settings for more than forty years. He is currently the Director at Annamacharya Institute of Technology & Sciences, Tirupati.