Quicklinks
Course overview
Schedule
Prerequisites
Objectives
Homeworks, exams, and grading
Course overview
Announcements
1116. HW6 is out.
1030. HW5 is out.
1026. Lab 4 is out.
1018. HW4 is out.
1012. Lab 3 is out.
103. HW3 out, due on 1012. Recommend working on it before the exam as a practice.
921. HW2 out, due on 928
98. Lab 2 is out.
98. Homework 1 is out, due Sep 14 before the class.
Schedule (Subject to change)
Week  Date  Topic  Assignments  Wed labs  
1 


831 
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  94  Labor Day, no class  96 Lab 1  
97  Introduction to Algorithms: Chap 0  
3  911  Graph Algorithms: Sections 3.1, 4.14.2  913 Recitation/ Office hours 

914  Graph Algorithms: Sections 3.1, 4.14.2  HW1 due 


4  918  Graph Algorithms: Sections 3.23.4  920 Lab 2  
921  Graph Algorithms: Sections 3.23.4  
5  925  Graph Algorithms: Sections 4.34.5, 4.7  927 Recitation/ Office hours  
928  Greedy Algorithms: Section 5.1  HW2 due  
6  102  Greedy Algorithms: Interval Scheduling  104 Recitation/ Office hours  
105  Greedy Algorithms: Interval Scheduling  
7  1010 TUES, following Monday schedule  Inclass Exam 1  1011 Recitation/ Office hours  
1012  Divide and Conquer: Section 2.3  HW3 due  
8  1016  Divide and Conquer: Sections 2.12.2  1018 Lab 3  
1019  Divide and Conquer, Randomized Algorithms:Sections 2.42.5  
9  1023  Divide and Conquer, Randomized Algorithms:Sections 2.42.5  1025 Recitation/ Office hours  
1026  Dynamic Programming: Sections 6.16.3  HW4 due  
10  1030  Dynamic Programming: Sections 6.16.3  111 Lab 4  
112  Dynamic Programming: Sections 6.4, 6.7  
11  116  Dynamic Programming: Sections 6.4, 6.7  118 Recitation/ Office hours 


119  Dynamic Programming: Sections 4.6, 6.6  HW5 due  
12  1113  Network Flow and Linear Programming: Sections 7.17.2  1115 Recitation/ Office hours  
1116  Inclass Exam 2  
13  1120  Network Flow and Linear Programming: Sections 7.27.3  None  
1123  Thanksgiving holiday  
14  1127  NPComplete Problems: Chapter 8  1129 Recitation/ Office hours  
1130  NPComplete Problems: Chapter 8  HW6 due  
15  124  NPComplete Problems: Chapter 8  126 Recitation/ Office hours  
127  NPComplete Problems: Chapter 8  HW7 due  
16  1211  Dealing with Intractability: Chapter 9  
17 


Final exam: Friday 12/22 11:302:30
Textbook
Algorithms by Dasgupta, Papadimitriou, and Vazirani. See also the textbook errata. 
Prerequisites
Objectives
Homeworks, exams, and grading
Students are highly encouraged to attend all classes. You are responsible for all material covered and announcements made in lecture.
Homework. Homework will be assigned every 12 weeks. Homework should be handed in at the beginning of lecture in class on the day it is due. For homework policies, see the 2300 Homework Guide.
Labs and Recitations. Labs will take place every Wednesday, and your attendance is required. For details and lab policies, see the 2300 Lab Guide.
Exams. There will be two midterm exams in class on October 10 and November 16, and a comprehensive final exam during finals week. All exams are opentextbook and opennotes. Makeup exams will not be given except in case of an emergency, accompanied by a letter from the Dean of Students excusing your absence from the exam. Students who know they are going to miss an exam must notify us in advance. Special circumstances can be accommodated if we are notified about them in advance.