Quicklinks

Course overview
Schedule
Prerequisites
Objectives
Homeworks, exams, and grading

Course overview

Announcements

11-16. HW6 is out.

10-30. HW5 is out.

10-26. Lab 4 is out.

10-18. HW4 is out.

10-12. Lab 3 is out.

10-3. HW3 out, due on 10-12. Recommend working on it before the exam as a practice.

9-21. HW2 out, due on 9-28

9-8. Lab 2 is out.

9-8. Homework 1 is out, due Sep 14 before the class.

Schedule (Subject to change)

Week Date Topic Assignments Wed labs  
1    

 

   

8-31

Introduction to Algorithms: Chap 0

Read the syllabus carefully

Sign up on Piazza

Vote on OPRA for office hours

Join CSCI 2300 OPRA Group

 

2 9-4 Labor Day, no class   9-6 Lab 1  
9-7 Introduction to Algorithms: Chap 0    
3 9-11 Graph Algorithms: Sections 3.1, 4.1-4.2  

9-13 Recitation/ Office hours

 
9-14 Graph Algorithms: Sections 3.1, 4.1-4.2 HW1 due

 

4 9-18 Graph Algorithms: Sections 3.2-3.4   9-20 Lab 2  
9-21 Graph Algorithms: Sections 3.2-3.4    
5 9-25 Graph Algorithms: Sections 4.3-4.5, 4.7   9-27 Recitation/ Office hours  
9-28 Greedy Algorithms: Section 5.1 HW2 due  
6 10-2 Greedy Algorithms: Interval Scheduling   10-4 Recitation/ Office hours  
10-5 Greedy Algorithms: Interval Scheduling    
7 10-10 TUES, following Monday schedule In-class Exam 1   10-11 Recitation/ Office hours  
10-12 Divide and Conquer: Section 2.3 HW3 due  
8 10-16 Divide and Conquer: Sections 2.1-2.2   10-18 Lab 3  
10-19 Divide and Conquer, Randomized Algorithms:Sections 2.4-2.5    
9 10-23 Divide and Conquer, Randomized Algorithms:Sections 2.4-2.5   10-25 Recitation/ Office hours  
10-26 Dynamic Programming: Sections 6.1-6.3 HW4 due  
10 10-30 Dynamic Programming: Sections 6.1-6.3   11-1 Lab 4  
11-2 Dynamic Programming: Sections 6.4, 6.7    
11 11-6 Dynamic Programming: Sections 6.4, 6.7   11-8 Recitation/ Office hours

 

11-9 Dynamic Programming: Sections 4.6, 6.6 HW5 due  
12 11-13 Network Flow and Linear Programming: Sections 7.1-7.2   11-15 Recitation/ Office hours  
11-16 In-class Exam 2    
13 11-20 Network Flow and Linear Programming: Sections 7.2-7.3   None  
11-23 Thanksgiving holiday    
14 11-27 NP-Complete Problems: Chapter 8   11-29 Recitation/ Office hours  
11-30 NP-Complete Problems: Chapter 8 HW6 due  
15 12-4 NP-Complete Problems: Chapter 8   12-6 Recitation/ Office hours  
12-7 NP-Complete Problems: Chapter 8 HW7 due  
16 12-11 Dealing with Intractability: Chapter 9      
       
17

 

 

     
         

Final exam: Friday 12/22 11:30-2:30

 

Textbook

 Algorithms by Dasgupta, Papadimitriou, and Vazirani. See also the textbook errata.

Prerequisites

Objectives

Homeworks, exams, and grading