|
Week - 1 |
Introduction to Algorithms, Asymptotic Notations |
|
Week - 2 |
Recursive Algorithms, Closest-Pair Problem |
|
Week - 3 |
Sorting |
|
Week - 4 |
Medians, Introduction to Dynamic Programming: 0-1 Knapsack Problem |
|
Week - 5 |
More Dynamic Programming: Longest Commong Subsequence, Chain Matrix Multiplication |
|
Week - 6 |
MIDTERM I |
|
Week - 7 |
Introduction to Greedy Algorithms: Activity Selection, Huffman Codes |
|
Week - 8 |
Introduction to Graphs: Representation, BFS, DFS |
|
Week - 9 |
Basic Graph Algorithms: Topological Sort, Strongly Connected Components |
|
Week - 10 |
MIDTERM II |
|
Week - 11 |
Introduction to NP-Completeness |
|
Week - 12 |
NP-Completess and Approximation Algorithms |
Eskisehir Technical University Info Package