DESIGN METHODS AND ANALYSIS OF ALGORITHMS

by S. K. BASU

Overview

The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialised, teaches the skills needed to master the essentials of this subject. With clear explanations and an engaging writing style, the book places increased emphasis on algorithm design techniques rather than programming in order to develop problem-solving skills.The treatment throughout the book is primarily tailored to the curriculum needs of B.Tech. students in computer science and engineering, B.Sc. (Hons.) and M.Sc. students in computer science, and MCA students. The book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a reader-friendly text. Elementary analysis of time complexities is provided for each example-algorithm. A varied collection of exercises at the end of each chapter serves to reinforce the principles/methods involved.New To This EditionAdditional problemsA new Chapter 14 on Bioinformatics AlgorithmsThe following new sections: BSP model (Chapter 0) Some examples of average complexity calculation (Chapter 1) Amortisation (Chapter 1) Some more data structures (Chapter 1) Polynomial multiplication (Chapter 2) Better-fit heuristic (Chapter 7) Graph matching (Chapter 9) Function optimisation, neighbourhood annealing and implicit elitism (Chapter 12) Additional matter in Chapter 15AppendixRead more

Product Details

ISBN-13:	9788120347465
Publisher:	PHI Learning
Publication date:	04/17/2013
Sold by:	Barnes & Noble
Format:	eBook
Sales rank:	925,281
File size:	6 MB

About the Author

<STRONG>S. K. BASU</STRONG>, Ph.D., is Professor in the Department of Computer Science, Banaras Hindu University, Varanasi. He obtained his M.Tech. and Ph.D. degrees from Indian Statistical Institute, Kolkata, and Jadavpur University, Kolkata respectively. He has been a visiting scientist in different Indian institutes and abroad. He was the Chairman of the Department of Computer Science, Banaras Hindu University several times and also held various other administrative positions in the same university. Some of his active research and publications are in the areas of Parallel and Distributed Processing, Simulation Modelling, Genetic Algorithms, Computer Systems, WSN, etc.

Table of Contents

<EM>List of Figures • List of Tables</EM>

<EM>Preface • Preface to the First Edition</EM>

<EM>Acknowledgements</EM>

0.&nbsp;&nbsp;&nbsp; Computational Models

1.&nbsp;&nbsp;&nbsp; Basics of Algorithm

2.&nbsp;&nbsp;&nbsp; Divide and Conquer

3.&nbsp;&nbsp;&nbsp; Greedy Method

4.&nbsp;&nbsp;&nbsp; Dynamic Programming

5.&nbsp;&nbsp;&nbsp; Further Divide and Conquer

6.&nbsp;&nbsp;&nbsp; A Bit of Theory

7.&nbsp;&nbsp;&nbsp; Approximation Algorithms

8.&nbsp;&nbsp;&nbsp; Randomized Algorithms

9.&nbsp;&nbsp;&nbsp; Graph Algorithms

10.&nbsp; Backtracking, Branch and Bound

11.&nbsp; Lower Bound Techniques

12.&nbsp; Genetic Algorithms

13.&nbsp; Parallel Algorithms

14.&nbsp; Bioinformatics Algorithms

15.&nbsp; Conclusion

<EM>Appendix • Bibliography</EM>

<EM>Index</EM></P>