Other resources/recommended reading (all on a 2 hour reserve in the library; or free):
TOPIC: Greedy algorithms. Dynamic programming. (Homework #1 due Sep. 12, exam #1 on Sep. 19.)
Reading:
homework 1
Problem sessions:
 Sep. 9 (Monday) 6:15pm  7:15pm in Hylan 202 (Daniel Ro)
 Sep. 10 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Yiyang Su)
 Sep. 11 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Hanlin Tang)
 Sep. 11 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Hanlin Tang)
 Sep. 16 (Monday) 6:15pm  7:15pm in Hylan 202 (Patrick Phillips)
 Sep. 17 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Yipeng Zhang)
 Sep. 18 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Yipeng Zhang)
 Sep. 18 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Patrick Phillips)
Aug. 29 Th  Introduction.
Sep. 3 Tu  When does greedy algorithm for the coin change problem work?
Sep. 5 Th  Dynamic programming for the coin change problem. Knapsack (integer weights).
Sep. 10 Tu  Knapsack revisited (integer values). Longest increasing subsequence.
Sep. 12 Th  Edit distance. Chain matrix multiplication.
Sep. 17 Tu  More dynamic programming problems.
Sep. 19 Th  EXAM #1 (topics: Greedy algorithms/Dynamic programming)
TOPIC: Graph algorithms. (Homework #2 due Oct. 10, homework #3 due Oct. 24, exam #2 on Oct. 31.)
Reading:
 [CLRS] Chapters 22, 23, 24, 25, 26 (excluding sections 26.4, 26.5),
 [Erickson] Chapters 4,5,6,7,8,9,10,11 (Graph algorithms),
 [DPV] Chapters 3, 4, 5.
homework 2
homework 3
Problem sessions:
 Oct. 7 (Monday) 6:15pm  7:15pm in Hylan 202 (Patrick Phillips)
 Oct. 8 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Yipeng Zhang)
 Oct. 9 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Yipeng Zhang)
 Oct. 9 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Patrick Phillips)
 Oct. 21 (Monday) 6:15pm  7:15pm in Hylan 202 (Daniel Ro)
 Oct. 22 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Yiyang Su)
 Oct. 23 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Lusine Keshishyan)
 Oct. 23 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Lusine Keshishyan)
 Oct. 28 (Monday) 6:15pm  7:15pm in Hylan 202 (Laasya Bangalore)
 Oct. 29 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Laasya Bangalore)
 Oct. 30 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Lusine Keshishyan)
 Oct. 30 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Lusine Keshishyan)
Sep. 24 Tu  Undirected graphs, finding connected components, DFS.
Sep. 26 Th  Directed graphs, strong connectedness, linearization (topological sorting).
Oct. 1 Tu  Strongly connected components.
Oct. 3 Th  BFS, Shortest paths (Dijkstra)
Oct. 8 Tu  Dealing with negative edge weights (Bellman Ford). FloydWarshal.
Oct. 10 Th  Matchings I.
Oct. 15 Tu  No class (Fall break).
Oct. 17 Th  Matchings II.
Oct. 22 Tu  Minimum spanning trees.
Oct. 24 Th  Flows I.
Oct. 29 Tu  Flows II.
Oct. 31 Th  EXAM #2 (topics: Graph algorithms)
TOPIC: Linear programming. Reductions (NPcompleteness). (Homework #4 due Nov. 21, no exam)
Reading:
 [CLRS] Chapter 34,
 [Erickson] Chapter 12 (NP),
 [DPV] Chapter 8.
homework 4.
Problem sessions:
 Nov. 18 (Monday) 6:15pm  7:15pm in Hylan 202 (Daniel Ro)
 Nov. 19 (Tuesday) 6:15pm  7:15pm in Goergen 109 (Yiyang Su)
 Nov. 20 (Wednesday) 6:15pm  7:15pm in Gavett 310 (Hanlin Tang)
 Nov. 20 (Wednesday) 7:40pm  8:40pm in Hutchinson 473 (Hanlin Tang)
Nov. 5 Tu  Modeling with linear programs I (classical problems).
Nov. 7 Th  Solving systems of equations (Gaussian elimination), solving systems on inequalities (FourierMotzkin elimination).
Nov. 12 Tu  Duality, Modeling with linear programs II (zerosum games).
Nov. 14 Th  Linear programming for approximation (relaxation, rounding).
Nov. 19 Tu  More linear programming.
Nov. 21 Th  NP completness, reductions I.
TOPIC: Divide and Conquer Algorithms (Homework #5 due Dec. 5, no exam)
Grading

The grade for the course is computed from the exam grade (40%), the homework grade (10%), and
the final exam grade (50%).
Homework Rules
 Homework is collected on the due date, before class, in the classroom.
 No late homework will be accepted without instructor's
permission (a permission must be requested at least 24 hours
before the due date).
 You may work with other people on the
homework, but you must each write up your solutions separately
(without any written aid). If you work with other people, indicate
who you worked with on your solution.
Test Rules
 All tests are closed book. No text
or notes. No scratch paper allowed. No electronic devices (calculators, phones, computers, etc).
 There will be 2
fullclass exams and a final exam. There will be no makeup exams.
This course follows
The University Policy on Academic Honesty .