| 1 |
Asymptotic notations |
|
| 2 |
Heap sort |
|
| 3 |
Recursive algorithms |
|
| 4 |
Hanoi tower and complexity |
|
| 5 |
Divide and Conquer approach |
|
| 6 |
Decision tree |
|
| 7 |
Divide and conquer sorts |
|
| 8 |
tournament scheduling |
|
| 9 |
Greedy approaach |
|
| 10 |
Motivation for the course |
|
| 11 |
Asymptotic notations |
|
| 12 |
Binary tree and heap |
|
| 13 |
questions/answers |
|
| 14 |
Intr. to Parallel Algorithms |
|
| 15 |
Decision problems and non-determinism |
|
| 16 |
Branch and Bound-based Examples |
|
| 17 |
Optimal Solution of TSP Problem |
|
| 18 |
Branch and Bound approach |
|
| 19 |
Othe rBacktrack-based Problem examples |
|
| 20 |
Backtracking approach |
|
| 21 |
n-queen problem |
|
| 22 |
Midterm Exam |
|
| 23 |
Tree and graph-based algorithms |
|
| 24 |
Dynamic programming-based examples |
|
| 25 |
Genomic sequence alignment |
|
| 26 |
Edit distance problem |
|
| 27 |
Dynamic programming Approach |
|
| 28 |
Greedy Problem Exapmles |
|
| 29 |
optimal spannig tree |
|
| 30 |
|
|