Design and Analysis of Algorithms

Announcements

  • Here is a review guide for the final. Solutions to the review guide are posted outside our offices.
  • After you've submitted a late homework via git, please email us notification. This will help streamline the grading process.

Schedule

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

WEEK DAY ANNOUNCEMENTS TOPIC & READING LABS     
1

Sep 04

   Course introduction
Stable matching
read: chapter 1		 set up github

hw 1

Sep 06

  
2

Sep 11

   Analysis
read: chapter 2.1-2.4		 lab 1
hw 2

Sep 13

Drop/add ends (Sep 14)
3

Sep 18

   lab 2
hw 3

Sep 20

   Graph algorithms
read: chapter 3
4

Sep 25

   lab 3
hw 4

Sep 27

  
5

Oct 02

   lab 4
hw 5

Oct 04

   Greedy algorithms
read: chapter 4
6

Oct 09

   lab 5
hw 6

Oct 11

  
 

Oct 16

Fall break

Oct 18
7

Oct 23

midterm 7-10pm (SCI 101)

 Divide and conquer
read: chapter 5		 lab 6
hw 7

Oct 25

  
8

Oct 30

   Dynamic programming
read: chapter 6.1, 6.2, 6.5.
optional reading: chapter 6.3, 6.4		 lab 7
hw 8

Nov 01

  
9

Nov 06

   lab 8
hw 9

Nov 08

CR/NC/W Deadline (Nov 09)

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

Nov 13

   lab 9
hw 10

Nov 15

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

Nov 20

   lab10

Nov 22

Thanksgiving break
12

Nov 27

   Intractability
read: chapter 8.1-8.4; see also CLRS chapter 34 (continued)		 lab11
hw 11
rewrite 2

Nov 29

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

Dec 04

   lab12
hw 12

Dec 06

   Randomized algorithms
read: chapter 13.1-13.5
14

Dec 11

Course review

Last day of classes

  

Dec 14

Final Exam period begins