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.