Algorithms: Design and Analysis - Softcover

Bhasin, Harsh

9780199456666: Algorithms: Design and Analysis

Softcover

ISBN 10: 0199456666 ISBN 13: 9780199456666

Publisher: Oxford University Press, 2015

View all copies of this ISBN edition

1 Used

From US$ 128.59

3 New

From US$ 39.45

Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms.

The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms. The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms. Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms.

The book also has 10 appendixes which include topics like probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis and problems based on writing algorithms.

The concepts and algorithms in the book are explained with the help of examples which are solved using one or more methods for better understanding. The book includes variety of chapter-end pedagogical features such as point-wise summary, glossary, multiple choice questions with answers, review questions, application-based exercises to help readers test their understanding of the learnt concepts.

"synopsis" may belong to another edition of this title.

About the Author

Harsh Bhasin is the author of "Programming in C#," OUP, 2014; "Algorithms Design and Analysis," OUP, 2015 and "Python for Beginners," New Age International, 2018. Harsh is a B. Tech and M. Tech in Computer Science and is currently perusing his Ph. D.

He has worked as Assistant Professor in the Department of Computer Science, FMIT, Jamia Hamdard, New Delhi. Prior to this, he has taught as visiting faculty in many colleges including Delhi Technological University. He has also worked as a client side C# developer and was the proprietor S.S. Developers, a firm based in Faridabad, Haryana. Harsh has been involved in the development of a number of Enterprise Resource Planning Systems.

He has authored more than 60 research papers in various national and international journals of repute including those in Soft Computing, Springer and AI and Society. He has also reviewed papers, journals and books for renowned publishers.

He has been actively involved in research and had also received the Young Researchers Award by ErNet in 2012. His areas of interest include Genetic Algorithms, Cellular Automata, Machine Learning, Theory of Computation, C# and Algorithms.

"About this title" may belong to another edition of this title.