Design & Analysis of Algorithms
Book Details:
тАв Author: Biswajit Bhowmik
тАв Publisher: S.K. Kataria & Sons
тАв Edition: 2012
тАв Language: English
тАв Number of Pages: 475
тАв Binding: Paperback
тАв Release Date: 01 December 2012
тАв ISBN: 9789350141359
About the Book:
This book is a comprehensive guide to algorithms and data structure problem-solving techniques, specially designed for computer science and information technology students. Written by Biswajit Bhowmik, the book explains algorithm design strategies and computational problem-solving methods in a clear and systematic manner.
The book covers important topics including asymptotic notations, recursion and recurrence relations, divide and conquer paradigm, dynamic programming, greedy algorithms, backtracking, branch and bound, graph traversal algorithms, matrix manipulation algorithms, NP-completeness, approximation algorithms, file compression, topological sorting, strongly connected components, DijkstraтАЩs algorithm, and large integer multiplication. It also includes GATE questions, solved model papers, previous yearsтАЩ examination papers, bibliography, and index for academic preparation and competitive exam practice.
With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, programming practice, competitive examinations, and professional learning in algorithms and computer science.
Product Information
Product Information
Shipping & Returns
Shipping & Returns
Design & Analysis of Algorithms
Design & Analysis of Algorithms
Book Details:
тАв Author: Biswajit Bhowmik
тАв Publisher: S.K. Kataria & Sons
тАв Edition: 2012
тАв Language: English
тАв Number of Pages: 475
тАв Binding: Paperback
тАв Release Date: 01 December 2012
тАв ISBN: 9789350141359
About the Book:
This book is a comprehensive guide to algorithms and data structure problem-solving techniques, specially designed for computer science and information technology students. Written by Biswajit Bhowmik, the book explains algorithm design strategies and computational problem-solving methods in a clear and systematic manner.
The book covers important topics including asymptotic notations, recursion and recurrence relations, divide and conquer paradigm, dynamic programming, greedy algorithms, backtracking, branch and bound, graph traversal algorithms, matrix manipulation algorithms, NP-completeness, approximation algorithms, file compression, topological sorting, strongly connected components, DijkstraтАЩs algorithm, and large integer multiplication. It also includes GATE questions, solved model papers, previous yearsтАЩ examination papers, bibliography, and index for academic preparation and competitive exam practice.
With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, programming practice, competitive examinations, and professional learning in algorithms and computer science.
Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
Book Details:
тАв Author: Biswajit Bhowmik
тАв Publisher: S.K. Kataria & Sons
тАв Edition: 2012
тАв Language: English
тАв Number of Pages: 475
тАв Binding: Paperback
тАв Release Date: 01 December 2012
тАв ISBN: 9789350141359
About the Book:
This book is a comprehensive guide to algorithms and data structure problem-solving techniques, specially designed for computer science and information technology students. Written by Biswajit Bhowmik, the book explains algorithm design strategies and computational problem-solving methods in a clear and systematic manner.
The book covers important topics including asymptotic notations, recursion and recurrence relations, divide and conquer paradigm, dynamic programming, greedy algorithms, backtracking, branch and bound, graph traversal algorithms, matrix manipulation algorithms, NP-completeness, approximation algorithms, file compression, topological sorting, strongly connected components, DijkstraтАЩs algorithm, and large integer multiplication. It also includes GATE questions, solved model papers, previous yearsтАЩ examination papers, bibliography, and index for academic preparation and competitive exam practice.
With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, programming practice, competitive examinations, and professional learning in algorithms and computer science.
