Week 1-2 | Basics
(what is an algorithm and its representation by pseudo code, searching algorithm) | ||||||||||
Week 2 | Mathematical Induction | ||||||||||
Week 3 | Efficiency of algorithms
(Big-O notation) Week 4-5 | Polynomial and Exponential algorithms
|
(pattern matching, sorting algorithms, exhaustive search algorithms - Traveling Salesman Problem, Knapsack Problem) Week 6-7 | Divide and Conquer
technique
|
(mergesort, tower of hanoi, fibonacci number, time complexity analysis via recurrence relations) Week 8-9 | Review of graph structures
and some basic graph algorithms
|
(undirected and directed graphs and their representations, trees; depth first search, breadth first search) Week 9-10 | Greedy methods
|
(Single-source shortest path problem, Minimum Spanning Tree) Week 11-12 | Dynamic programming technique
|
(Fibonacci number, assembly line scheduling) |