 |
| Design & Analysis of Algorithms |
1. Introduction to Algorithm Analysis
2. Divide and Conquer Approach
3. Greedy Method
4. Dynamic Programming
5. Branch and Bound
6. Backtracking
7. Pattern Matching
8. Assignment Problem
9. Randomized Algorithms
10. Flow Networks
11. NP Completeness
12. Solutions
No comments:
Post a Comment