Lecture Schedule and Notes

 
WEEK TOPICS CHAPTERS in CLRS*
1 Introduction I.1 - I.2  
2 Analysis of Algorithms: Running Time, Tilde Notation

I.3  

Lecture 1  

3 Asymptotic Analysis:Order of Growth I.3
4 Divide and Conquer: Karatsuba Multiplication, Master Method

I.4- Quiz I

Lecture 2

Lecture 3

5 Sorting Algorithms: Heaps, Priority Queues II.6- II.7
6 Advanced Sorting: Count Sort, Bucket Sort, Radix Sort

II.8

Lecture 4

7 Searching: BST

III- Quiz II

Lecture 5

Lecture 6

8 Graph Algorithms: Directed/Undirected Graphs,​BFS

VI.22

Lecture 7

9 Graph Algorithms: DFS, Topological Sorting VI.22
10 Minnimum Spanning Trees VI.23
11 Single-Source Shortest Paths

VI.24- Quiz III

Lecture 8

12 Greedy IV.16
13 &Dynamic Programming

IV.15

Lecture 9

14 Review  
 
*CLRS: Cormen, Leiserson, Rivest, Stein