Updated 13 - 6 - 2012

Lecture 1 7/03/12 Analysing Algorithms
Lecture 2 8/03/12 Growth of Functions
Lecture 3 14/03/12 Asymptotic Notation
Lecture 4 5/03/12 Asymptotically Optimal Algorithms
Lecture 5 21/03/12 Divide and Conquer - Merge Sort
Lecture 6 22/03/12 Quick Sort
Lecture 7 28/03/12 Lower Bound for Sorting
Lecture 7 28/03/12 Bounding Sum By Integrals
Lecture 7 28/03/12 The Master Theorem
Lecture 8 29/03/12 Heaps - Priority Queues
Lecture 9 4/04/12 Heapsort
Lecture 10 5/04/12 Representation Of Graphs
Lecture 11 25/04/12 Elementary Graphs Algorithms (BFS,DFS, connected components)
Lecture 12 26/04/12 Greedy Algorithms
Lecture 13 2/05/12 Shortest Paths - algorithm Dijkstra
Lecture 14 3/05/12 Spanning Trees
Lecture 14 3/05/12 Prim Algorithm
Lecture 15 9/05/12 Kruskal Algorithm
Lecture 16 10/05/12 Union And Find
Lecture 16 10/05/12 Spanning Trees and TSP
Lecture 17 17/05/12 Topological Sort
Lecture 17 17/05/12 0-1 and continuous Knapsack - Greedy algorithms
Lecture 18 23/05/12 Huffmann codes
Lecture 19 23/05/12 Dynamic Programming - Shortest and Longest Paths in Dags
Lecture 20 24/05/12 Shortest Paths - algorithm Bellman
Lecture 21 30/05/12 0-1 Knapsack by Dynamic Programming
Lecture 22 31/05/12 Longest common subsequence (LCS)
Lecture 23 6/06/12 Exchaustive Search (k-Queens -TSP - Knapsack)
Lecture 24 7/06/12 Decision Problems
Lecture 25 13/06/12 NP completeness

 

Current Lesson