
Design and Analysis of Algorithms
Manas Ranjan Kabat(Author)
PHI Learning (Publisher)
Published on 30. December 2013
Book
Paperback/Softback
356 pages
978-81-203-4806-6 (ISBN)
Description
Primarily designed as a text for undergraduate students of computer science and engineering and information technology, and postgraduate students of computer applications, the book will also be useful to postgraduate students of computer science and IT (M.Sc., Computer Science; M.Sc., IT). The objective of this book is to expose students to basic techniques in algorithm design and analysis.
This well organised text provides the design techniques of algorithms in a simple and straightforward manner. Each concept is explained with an example that helps students to remember the algorithm devising techniques and analysis. The text describes the complete development of various algorithms along with their pseudo-codes in order to gain an understanding of their applications. It also discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.
Key Features - Randomised and approximation algorithms are explained well to reinforce understanding of the subject matter.
- Various methods for solving recurrences are well explained with examples.
- NP-completeness of various problems are proved with simple explanations.
This well organised text provides the design techniques of algorithms in a simple and straightforward manner. Each concept is explained with an example that helps students to remember the algorithm devising techniques and analysis. The text describes the complete development of various algorithms along with their pseudo-codes in order to gain an understanding of their applications. It also discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.
Key Features - Randomised and approximation algorithms are explained well to reinforce understanding of the subject matter.
- Various methods for solving recurrences are well explained with examples.
- NP-completeness of various problems are proved with simple explanations.
More details
Language
English
Place of publication
New Delhi
India
Target group
College/higher education
Dimensions
Height: 235 mm
Width: 178 mm
Thickness: 50 mm
Weight
542 gr
ISBN-13
978-81-203-4806-6 (9788120348066)
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
Manas Ranjan Kabat, PhD, is Reader and Head, Department of Computer Science and Engineering, VSS University of Technology, Burla, Odisha, India. With over a decade of teaching experience both at undergraduate and postgraduate levels, Dr. Kabat has published more than 20 research papers in various referred international journals and conferences. His research interests include QoS in Internet and Wireless Sensor Networks.