| 1 |
Course Introduction |
|
| 2 |
Waiting for new students |
|
| 3 |
Waiting for new students |
|
| 4 |
Waiting for new students |
|
| 5 |
Waiting for new students |
|
| 6 |
Advancde concepts and symbols |
|
| 7 |
Advancde concepts and symbols |
|
| 8 |
Average case time complexity |
|
| 9 |
Amortized time complexity |
|
| 10 |
P and NP problems |
|
| 11 |
P and NP problems |
|
| 12 |
NP-hard problems |
|
| 13 |
NP complete problems |
|
| 14 |
Hill climbing methods |
|
| 15 |
Solving satisfiability problem |
|
| 16 |
Edit distance using dynamic program |
|
| 17 |
Optimal sequence alignment |
|
| 18 |
ِApproximate sequenc alignment |
|
| 19 |
Linear programming |
|
| 20 |
Midterm Exam |
|
| 21 |
Random algorithms |
|
| 22 |
Computational geometry |
|
| 23 |
Approximate algorithms |
|
| 24 |
Students presentation |
|