Syllabus

Week 1 Introduction - Models of Computation 
Week 2 Asymptotic & Algorithmic Analysis : running time of algorithm
Week 3 Asymptotic 2: Order of Growth
Week 4 Divide and Conquer Algorithms - Quiz 1
Week 5 Basic Data Structures 
Week 6 Binary Search Trees- Balanced Search Trees
Week 7 Heaps, Peak Finding, Priority Queues
Week 8 Advanced Sorting - Quiz 2
Week 9 Graphs - Directed & undirected graphs
Week 10 Graphs - DFS, BFS, 
Week 11 Weighted Graphs - Minimum Spanning Trees 
Week 12 Shortest Path - Quiz 3
Week 13 Dynamic Programming       
Week 14 Term Paper Presentations