• 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 • Large Integers Multiplication • File Compression • Biconnectivity • Strongly Connected Components • Topological Sorting • Dijkstra’s Algorithm • Gate Questions • Model Question Papers • Previous Year Examination Papers (Solved) • Bibliography • Index.
You have no items to compare.
Please login to access Wishltist
Fill up your details to notify you when this book will be available