Design Methods and Analysis of Algorithms
2nd Edition
Published on 30. July 2013
Book
Paperback/Softback
400 pages
978-81-203-4746-5 (ISBN)
Description
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 Edition - Additional problems
- A new Chapter 14 on Bioinformatics Algorithms
- The 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 15
- Appendix
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 Edition - Additional problems
- A new Chapter 14 on Bioinformatics Algorithms
- The 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 15
- Appendix
More details
Edition
2nd Revised edition
Language
English
Place of publication
New Delhi
India
Target group
College/higher education
Professional and scholarly
Edition type
Revised edition
Dimensions
Height: 230 mm
Width: 180 mm
Thickness: 20 mm
Weight
612 gr
ISBN-13
978-81-203-4746-5 (9788120347465)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
S. K. Basu, 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.