Weeks
|
Topics covered
|
Comments / Dues
|
|
Week 1
1/17/06
|
- Introduction
[slides]
- Ch
2: Algorithm Correctness, Loop invariance,
runtime analysis – insertion sort.
|
|
|
Week 2
1/24/06
|
- Ch 2
(cont.) divide and conquer, – Merge sort
- Analysis
of recursive algorithms, Recursion Trees, Asymptotic Growth function,
|
HW1 is posted
|
|
Week 3
1/31/06
|
- Recursion
Trees, Asymptotic Growth function
|
HW1 is due 1/31/06
Quiz1 on 2/2/06
[Solutions]
|
|
Week 4
2/7/06
|
- Recursion,
Master Theorem
|
HW2 is due 2/7/06
|
|
Week 5
2/14/06
|
- Master
Thm (cont)
- Heaps
and Heap Sort
|
Quiz 2 on 2/17/06
[Solutions]
|
|
Week 6
2/21/06
|
- Heaps
and Heap Sort
- Mid
Term 1 on Feb 24th
|
HW3 due 2/21/06
|
|
Week 7
2/28/06
|
- Quick
Sort
- Lower
bound on comparison-base sort
- Sorting
in linear time: Counting Sort
|
|
|
Week 8
3/7/06
|
- Sorting
in linear time: Radix Sort, Bucket Sort
- Median
and Order Statistics.
|
HW 4 due 3/7/06
Quiz 3 on 3/10/06
|
|
Week 9
3/14/06
|
J Spring Break J
|
|
|
Week 10
3/21/06
|
- Graph
Algorithms: representations, graph traversal: BFS, DFS
|
HW 5 is due 3/21/06
Quiz 4 [Solutions]
|
|
Week 11
3/28/06
|
- Graph
Algorithms: Topological Sorting, Strongly Connected Components
- Minimum
spanning trees
|
|
|
Week 12
4/4/06
|
- Minimum
spanning trees
- Graph
Algorithms: Ch 24: Shortest path Algorithms.
|
HW 6 due 4/7/06
|
|
Week 13
4/11/06
|
- Mid
Term II on April 14th
- Graph
Algorithms: Ch 24: Shortest path Algorithms.
|
MidTerm
II solutions
|
|
Week 14
4/18/06
|
- Graph
Algorithms: Ch 24: Shortest path Algorithms.
- Dynamic
Programming: Section 15.2: Matrix Multiplication
|
|
|
Week 15
4/25/06
|
- Dynamic
Programming and All-pairs shortest path. Chapter 25 (sec 1 and 2)
- NP,
P… Chapter 34 (pages 966—971)
|
HW 7 due 4/25/06
[Solutions]
Quiz 5 on 4/28/06
[Solutions]
|