Design And Analysis Of Algorithms

Front Cover
I. K. International Pvt Ltd, Jan 1, 2009 - 272 pages
6 Reviews
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.Key Features:" Focuses on simple explanations of techniques that can be applied to real-world problems." Presents algorithms with self-explanatory pseudocode." Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers." Includes chapter summary, self-test quiz and exercises at the end of each chapter. Key to quizzes and solutions to exercises are given in appendices.
 

What people are saying - Write a review

User Review - Flag as inappropriate

not well explain

User Review - Flag as inappropriate

One of the most useful books that ever could find for data structures........

All 6 reviews »

Contents

Introduction to Algorithms
1
Disjoint Sets
41
Divide and Conquer
67
Greedy Method
85
Dynamic Programming
115
Backtracking
149
Branch and Bound
167
NPComplete Problems
179
Appendix A Key to SelfTest Quiz
191
Appendix B Answers and Hints to Exercises
197
Backtracking
241
Branch and Bound
246
NPComplete Problems
252
References
255
Index
257

Common terms and phrases

Bibliographic information