MCS-211 English Topics Covered
Block 1 – Introduction to Algorithms
- Unit 1 – Basics of an Algorithm and its Properties
- Unit 2 – Asymptotic Bounds
- Unit 3 – Complexity Analysis of Simple Algorithms
- Unit 4 – Solving Recurrences
Block 2 – Design Techniques-I
- Unit 1 – Greedy Technique
- Unit 2 – Divide and Conquer Technique
- Unit 3 – Graph Algorithm-I
Block 3 – Design Techniques–II
- Unit 1 – Graph Algorithms-II
- Unit 2 – Dynamic Programming Technique
- Unit 3 – String Matching Algorithms
Block 4 – NP-Completeness and Approximation Algorithm
- Unit 1 – Introduction to Complexity Classes
- Unit 2 – NP-Completeness and NP-Hard Problems
- Unit 3 – Handling Intractability