|
CSE 4833 / 6833 Introduction to Algorithms: Fall 2008
All dates and assignments are tentative except for the final exam
date. I will adjust this schedule as the semester progresses.
Week |
Class Dates |
Assignments |
Lecture Topics and Reading
Assignments |
1 |
Mon, Aug 18 |
|
Chapter 1 (all): What is an
algorithm?
Chapter 2
(all): Getting started, insertion sort, merge sort, basic
analysis |
Wed, Aug 20 |
|
2 |
Mon, Aug 25 |
Hw #1
out |
Chapter 2 continued
Chapter 3
(all): Growth of functions, asymptotic notation, standard notation
and common functions |
Wed, Aug 27 |
|
3 |
Mon, Sep 1
(Labor Day; no class) |
|
Chapter 3 continued |
Wed, Sep 3 |
|
4 |
Mon, Sep 8 |
Hw #1 due
|
Chapter 4 (4.1, 4.2, 4.3):
Recurrences |
Wed, Sep 10 |
Hw #2
out |
5 |
Mon, Sep 15 |
|
Chapter 4 continued
Appendix A: Properties of summations |
Wed, Sep 17
|
|
6 |
Mon, Sep 22 |
Hw #2 due |
Chapter 4 continued
|
Wed, Sep 24 |
|
7 |
Mon, Sep 29 |
|
|
Wed, Oct 1 |
Midterm #1
Hw #3
out |
8 |
Mon, Oct 6
(Fall break; no class) |
|
Chapter 6 (6.1, 6.2, 6.3, 6.4, 6.5):
Heapsort |
Wed, Oct 8 |
|
9 |
Mon, Oct 13 |
|
Chapter 7 (7.1, 7.2, 7.3): Quicksort
|
Wed, Oct 15 |
Hw #3 due |
10 |
Mon, Oct 20
|
NSF Survey |
National Science Foundation Survey
Midterm |
Wed, Oct 22
|
Midterm #2 |
11 |
Mon, Oct 27 |
|
Chapter 8 (8.1, 8.2, 8.3): Linear sorts
Chapter 15 (15.1, 15.2, 15.3, 15.4): Dynamic
programming |
Wed, Oct 29 |
Hw #4 out |
12 |
Mon, Nov 3 |
|
Chapter 15 continued
|
Wed, Nov 5 |
|
13 |
Mon, Nov 10 |
|
Chapter 16 (16.1, 16.2, 16.3): Greedy
algorithms |
Wed, Nov 12 |
Hw #4 due |
14 |
Mon, Nov 17 |
Hw #5 out |
Chapter 23 (B.4, 22.1, 23.1, 23.2): Minimum
spanning trees
Chapter 24 (22.2, 24.1, 24.3): Single-source
shortest paths |
Wed, Nov 19 |
|
15 |
Mon, Nov 24 |
|
|
Wed, Nov 26
(Thanksgiving; no class) |
|
16 |
Mon, Dec 1 |
Hw #5 due |
|
Wed, Dec 3
(Reading day; no class) |
|
|
17 |
Mon, Dec 8 |
Final Exam |
Final Exam: Mon, Dec 8, 12 – 3 pm, Butler 100 |
Last Modified:
August 06, 2012
|