Computer Science 282
Design and Analysis of Efficient
Instructor: Daniel Stefankovic
Thursday 11:05am-12:20pm, MEL 221.
Instructor office hours (CSB 620): Wednesday 6pm-7pm.
TA: Rupam Acharyya
TA office hours: Rupam Acharyya (CSB 727A) Monday 5pm-6pm.
"Exam" problem sessions (usually held by the instructor):
CSB 209, Wednesdays before exams, 6pm - 7pm.
Textbooks (all on a 2 hour reserve in the library):
- required: [DPV] = Algorithms, S. Dasgupta, C. Papadimitriou, U.
draft is available online), 2006.
- recommended: [CLRS] = Introduction to Algorithms (3rd edition),
T. Cormen, C. Leiserson, R. Rivest, and C. Stein, 2009.
Other resources/recommended reading (all on a 2 hour reserve in the library; or free):
Algorithms, J. Erickson, 2013.
Algorithm Design, J. Kleinberg and E. Tardos, 2005.
- The Design and Analysis of Algorithms, D. Kozen,
- The Design and Analysis of Computer
Algorithms, A. Aho, J. Hopcroft, J. Ulman, 1974.
Algorithms, R. Johnsonbaugh, M. Schaefer, 2003.
- How to Think About Algorithms
Algorithms, J. Edmonds, 2008.
Probability and Computing: Randomized Algorithms and
Probabilistic Analysis, M. Mitzenmacher, E. Upfal, 2005.
- Randomized Algorithms, R. Motwani, P. Raghavan,
- Approximation Algorithms, V. Vazirani,
- Algorithms, R. Sedgewick, K. Wayne, 2011.
- The Algorithm Design Manual, S. Skiena, 2008.
Prerequisites: CSC162 or CSC172 or MTH172.
TOPIC: Greedy algorithms/Dynamic programming
Sep. 2 Tu - When does greedy algorithm for the coin change problem work?
Sep. 4 Th - Dynamic programming for the coin change problem. Knapsack (integer weights).
Sep. 9 Tu - Knapsack revisited (integer values). Longest increasing subsequence.
Sep. 11 Th - Edit distance. Chain matrix multiplication.
Sep. 16 Tu - More dynamic programming problems.
Sep. 18 Th - EXAM #1 (topics: Greedy algorithms/Dynamic programming)
TOPIC: Graph algorithms
Sep. 23 Tu - Finding connected components, DFS, testing whether graph is strongly connected.
Sep. 25 Th - Linearization (topological sorting). Strongly connected components.
Sep. 30 Tu - BFS, Shortest paths (Dijkstra)
Oct. 2 Th - Dealing with negative edge weights(Bellman Ford). Floyd-Warshal.
Oct. 7 Tu - Matchings.
Oct. 9 Th - Minimum spanning trees.
Oct. 14 Tu - No class (Fall break).
Oct. 16 Th - Flows I.
Oct. 21 Tu - Flows II.
Oct. 23 Th - EXAM #2 (topics: Graph algorithms)
TOPIC: Linear programming
Oct. 28 Tu - Modeling with linear programs I (classical problems).
Oct. 30 Th - Solving systems of equations (Gaussian elimination), solving systems on inequalities (Fourier-Motzkin elimination)
Nov. 4 Tu - Duality, Modeling with linear programs II (zero-sum games).
Nov. 6 Th - Linear programming for approximation (relaxation, rounding).
Nov. 11 Tu - Solving linear programs.
Nov. 13 Th - EXAM #3 (topics: Linear programming)
TOPIC: Divide and Conquer Algorithms
Nov. 18 Tu - recurrences, Karatsuba-Offman algorithm
Nov. 20 Th - Fast fourier transform, convolution
Nov. 25 Tu - deterministic linear-time k-select algorithm
Nov. 27 Th - No class (Thanksgiving).
Dec. 2 Tu - randomized linear-time k-select algorithm
reading: [DPV] Chapter 8,
Dec. 4 Th - NP completness, reductions I.
Dec. 9 Tu - NP completness, reductions II.
Dec. 11 Th - EXAM #4 (topics: Divide and Conquer Algorithms and NP)
Comprehensive final exam Dec. 20 Saturday FINAL EXAM (4:00pm, MEL 221)
(following university final exam schedule)
The grade for the course is computed from the exam grade (50%), the homework grade (20%), and
the final exam grade (30%).
- Homework is collected on the due date, before class.
- No late homework will be accepted without instructor's
permission (a permission must be requested at least 24 hours
before the due date).
- In the final evaluation
the lowest homework score will be
- 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.
- All tests are closed book. No text
or notes, no scratch paper allowed.
- There will be 4
full-class exams and a final exam. There will be no make-up exams.
- In the computation of the exam grade the lowest exam
score will be dropped.
This course follows
The University Policy on Academic Honesty