On this page, you will find slides and other materials presented in class
You can browse the examples directly or by tags.
DAG
asymptotics
bounds
lecture
divide n conquer
dynamic programming
greedy
longest common subsequence
master theorem
median
minimum spanning tree
opencourseware
quicksort
randomized algorithm
recursion relation
recursion tree
sorting
summation
topological sort
Lecture 1
Wed 04 Jan 2012 12:00:00 AM AST
Lecture 2-3
Fri 06 Jan 2012 12:00:00 AM AST
Lecture 4-6
Sun 08 Jan 2012 12:00:00 AM AST
Lecture 7-8
Fri 20 Jan 2012 12:00:00 AM AST
Lecture 9
Wed 25 Jan 2012 12:00:00 AM AST
Lecture 11
Mon 30 Jan 2012 12:00:00 AM AST
Lecture 12,13
Wed 01 Feb 2012 12:00:00 AM AST
Lecture 17
Tue 14 Feb 2012 06:00:57 PM AST
Lecture 21
Wed 22 Feb 2012 12:00:00 AM AST