Block 1 – Introduction to Algorithms
Basics of an Algorithm and its Properties
Asymptotic Bounds
Complexity Analysis of Simple Algorithms
Solving Recurrences
Block 2 – Design Techniques-I
Greedy Technique
Divide and Conquer Technique
Graph Algorithm-I
Block 3 – Design Techniques–II
Graph Algorithms-II
Dynamic Programming Technique
String Matching Algorithms
Block 4 – NP-Completeness and Approximation Algorithm
Introduction to Complexity Classes
NP-Completeness and NP-Hard Problems
Handling Intractability
Reviews
There are no reviews yet.