| |
Design and analysis of algorithms plays a very important role in program writing. This book discusses the various design factors that make one algorithm more efficient than others, and explains how to devise new algorithms or modify the existing ones.
The book begins with an introduction to algorithm analysis and then presents different methods and techniques—divide and conquer methods, the greedy method, search and traversal techniques, backtracking methods, branch and bound methods—used in the design of algorithms. Each algorithm that is written in this book is followed first by a detailed explanation and then is supported by worked-out examples. The book contains a number of figures to illustrate the theoretical aspects and also provides chapter-end questions to enable students to gauge their understanding of the underlying concepts. What distinguishes the text is its compactness, which has been achieved without sacrificing essential subject matter.
This text is suitable for a course on “Design and Analysis of Algorithms”, which is offered to the students of B.Tech (Computer Science and Engineering, Electronics Communication and Engineering, Electronics and Instrumentation Engineering), and undergraduate and postgraduate students of computer science and computer applications [BCA, MCA, B.Sc. (CS), M.Sc. (CS)] and other computer-related courses.ISBN-- 978120335172
|
| |
Pages : 176
|