Design & Analysis of Algorithms

by Biswajit Bhowmik

Introduction to Algorithms Asymptotic Notations Recursion Vs Recurrence Divide and Conquer Paradigm Dynamic Programming Greedy Approach Backtracking Branch and Bound Lower Bound Theory Disjoint Set Manipulation Graph Traversals Matrix Manipulation Algorithms Notion of NP-Completeness Approximation Algorithms Model Question Papers Previous Years Examination Papers (Solved) Bibliography

Get BookMosh