| Name of the topic | Material | 
|---|---|
| Introduction |   | 
| Space and Time complexity |   | 
| Asymptotic Notation |   | 
| Algorithm Analysis |   | 
| Name of the topic | Material | 
|---|---|
| Brute Force Technique |   | 
| Divide and Conquer Technique |   | 
| Name of the topic | Material | 
|---|---|
| Dynamic Programming |   | 
| Greedy Techniques |   | 
| Name of the topic | Material | 
|---|---|
| Simplex Method |   | 
| MaxFlow? |   | 
| Maximum Matching |   | 
| Stable Marriage Problem |   | 
| Name of the topic | Material | 
|---|---|
| Backtracking |   | 
| TSP |   | 
| Branch & Bound |   | 
| Intractability |   | 
| Name of the test | Material | 
|---|---|
| UT1 |   | 
| UT1 Answers |   | 
| UT1 Retest |   | 
| Sample AU Answer Key |   | 
| UT2 |   | 
| UT2 -Retest |   | 
| UT3 |   | 
| UT3 - Retest |   |