| 1 |
Deterministic algorithms |
|
| 2 |
NP- hard problems |
|
| 3 |
Non-deterministic Machines |
|
| 4 |
Amortized time complexity |
|
| 5 |
Hill climbing heuristic |
|
| 6 |
Satisfiability using Hill climbing |
|
| 7 |
Linear Progamrming modeling |
|
| 8 |
Standard form of LP |
|
| 9 |
Midterm |
|
| 10 |
Linear Programming problems |
|
| 11 |
Convex hull |
|
| 12 |
Holiday |
|
| 13 |
Convex hull |
|
| 14 |
Sequence alignment intro |
|
| 15 |
Needleman-Wunsch SA |
|
| 16 |
Smith-waterman method |
|
| 17 |
Genome alignment |
|
| 18 |
Randomized Algorithms |
|
| 19 |
Computational geometry |
|
| 20 |
Algorithm complexities |
|
| 21 |
Course introduction and its importance |
|
| 22 |
Students' presentation |
|
| 23 |
Computational geometry |
|
| 24 |
Properties of AI models |
|