Design & Analysis of Algorithms

About Product

Table of Contents: 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 Years Examination Papers (Solved) Bibliography Index

Tags: Computer Engineering; Engineering;