CSE 4833 / 6833 Introduction to Algorithms, Fall 2009

All dates and assignments are tentative except for the final exam date.  I will adjust this schedule as the semester progresses.

Week Class Dates Events Lecture Topics and Reading Assignments
1 Mon, Aug 17   Chapter 1 (all): What is an algorithm?
Chapter 2 (all): Getting started, insertion sort, merge sort, basic analysis
Wed, Aug 19  
2 Mon, Aug 24 Hw #1 out Chapter 2 continued
Chapter 3 (all): Growth of functions, asymptotic notation, standard notation and common functions
Wed, Aug 26  
3 Mon, Sep 31
   Chapter 3 continued
Wed, Sep 2 Hw #1 due
4 Mon, Sep 7 No Class (Labor Day) Chapter 4 (4.1, 4.2, 4.3): Recurrences
Wed, Sep 9 Hw #2 out
5 Mon, Sep 14   Chapter 4 continued
Appendix A: Properties of summations
Chapter 6 (6.1, 6.2, 6.3, 6.4, 6.5): Heapsort
Wed, Sep 16  
6 Mon, Sep 21  
Wed, Sep 23 Hw #2 due; Hw #3 out
7 Mon, Sep 28 Midterm #1 Midterm (Chapters 1–4)
Chapter 6 continued
Wed, Sep 30  
8 Mon, Oct 5
 No Class (Fall Break) Chapter 7 (7.1, 7.2, 7.3): Quicksort
Wed, Oct 7  
9 Mon, Oct 12 Hw #3 due Midterm
National Science Foundation Survey
Wed, Oct 14 NSF BASE Exam
10 Mon, Oct 19
 Hw #4 out Chapter 8 (8.1, 8.2, 8.3): Linear sorts
Chapter 15 (15.1, 15.2, 15.3, 15.4): Dynamic programming
Wed, Oct 21
  
11 Mon, Oct 26   Chapter 15 continued
Wed, Oct 28  
12 Mon, Nov 2 Hw #4 due Midterm
Wed, Nov 4 Midterm #2
13 Mon, Nov 9 Hw #5 out Chapter 16 (16.1, 16.2, 16.3): Greedy algorithms
Wed, Nov 11  
14 Mon, Nov 16   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 18  
15 Mon, Nov 23    
Wed, Nov 25
 No Class (Thanksgiving)
16 Mon, Nov 30 Hw #5 due  
Wed, Dec 2
 No Class (Reading day)  
17 Mon, Dec 7 Final Exam 12 – 3 pm, Butler 100
Last Modified: August 06, 2012