Design and Analysis of Algorithms

Announcements

  • The first class will be Wednesday September 4.
  • I will be out the week of September 16 to attend the ICPC World Finals.

Schedule

This schedule is subject to modifications. Check back for the latest version!

WEEK DAY ANNOUNCEMENTS TOPIC & SUGGESTED READING LABS     
1

Sep 02

no classes -- Labor Day

 Course Introduction
Stable matching
read: chapter 1		 set up github
LearningLaTeX.tex

Sep 04

  

Sep 06

  
2

Sep 09

  

Sep 11

  

Sep 13

   Analysis
read: chapter 2.1-2.4
3

Sep 16

Drop/add ends

Sep 18

  

Sep 20

  
4

Sep 23

   Graph algorithms
read: chapter 3

Sep 25

  

Sep 27

  
5

Sep 30

  

Oct 02

  

Oct 04

   Greedy algorithms
read: chapter 4
6

Oct 07

  

Oct 09

  

Oct 11

  
 

Oct 14

Fall break

Oct 16

Oct 18
7

Oct 21

   Divide and conquer
read: chapter 5

Oct 23

  

Oct 25

  
8

Oct 28

  

Oct 30

   Dynamic programming
read: chapter 6.1, 6.2, 6.5.
optional reading: chapter 6.3, 6.4

Nov 01

  
9

Nov 04

  

Nov 06

  

Nov 08

   Network flow
read: chapter 7.1-7.3, 7.5, 7.9; see also CLRS chapter 26
10

Nov 11

  

Nov 13

  

Nov 15

   Intractability
read: chapter 8.1-8.4; see also CLRS chapter 34
11

Nov 18

  

Nov 20

  

Nov 22

  
12

Nov 25

   Approximation algorithms
read: chapter 11.1-11.4, 11.6, 11.8; see also CLRS chapter 35

Nov 27

  

Nov 29

Thanksgiving break
13

Dec 02

   Approximation algorithms
read: chapter 11.1-11.4, 11.6, 11.8; see also CLRS chapter 35 (continued)

Dec 04

  

Dec 06

   TBA and Class Review
14

Dec 09

  

Dec 11

Last day of classes