Computer Science 282/482

Design and Analysis of Efficient Algorithms

Fall 2024

Monday 6:15pm - 7:15pm in Hylan Building Room 202
Tuesday 6:15pm - 7:15pm Goergen Hall Room 109
Wednesday 6:15pm - 7:15pm in Gavett Hall Room 310
Wednesday 7:40pm - 8:40pm in Hutchison Hall Room 473

Textbooks:

A textbook is not required for this course. Homework problem statements will be self contained. It is a good idea to have access to the recommended books (electronic or paper; the version/edition is not too important) while taking the course and after.

recommended: [Erickson] = Algorithms, J. Erickson, 2019 (a paper copy available from Amazon).
recommended: [CLRS] = Introduction to Algorithms (3rd edition), T. Cormen, C. Leiserson, R. Rivest, and C Stein, 2009.
recommended: [DPV] = Algorithms, S. Dasgupta, C. Papadimitriou, U. Vazirani, 2006.

Other resources/recommended reading:

Algorithms Illuminated: Omnibus Edition, T. Roughgarden, 2022.
Algorithm Design, J. Kleinberg and E. Tardos, 2005.
Introduction to Algorithms: A Creative Approach, U. Manber, 1989.
The Design and Analysis of Algorithms, D. Kozen, 1991.
The Design and Analysis of Computer Algorithms, A. Aho, J. Hopcroft, J. Ulman, 1974.
Algorithms Algorithms, R. Johnsonbaugh, M. Schaefer, 2003.
How to Think About Algorithms Algorithms, J. Edmonds, 2008.
Algorithms, R. Sedgewick, K. Wayne, 2011.
The Algorithm Design Manual, S. Skiena, 2008.

Other resources/recommended reading (more advanced topics):

Probability and Computing: Randomized Algorithms and Probabilistic Analysis, M. Mitzenmacher, E. Upfal, 2005.
Randomized Algorithms, R. Motwani, P. Raghavan, 1995.
Approximation Algorithms, V. Vazirani, 2004.

Prerequisites: CSC162 or CSC172 or MTH172.

Schedule

TOPIC: Greedy algorithms. Dynamic programming. (Major homework #1 due Sep. 12, Exam #1 on Sep. 19.)

[CLRS] Chapter 15,
[Erickson] Chapter 3 (Dynamic programming),
[DPV] Section 5.2, Chapter 6,
advanced dynamic programming (Erickson).

Problem sessions:

Sep. 9 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Dylan McKellips)
Sep. 10 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Joe Saber)
Sep. 11 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Seif Mohamed)
Sep. 11 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Yekai Pan)

Sep. 16 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Owen Tian)
Sep. 17 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Colby Crews)
Sep. 17 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Dylan McKellips)
Sep. 18 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Yekai Pan)

Aug. 27 Tue - Introduction.
Aug. 29 Thu - When does greedy algorithm for the coin change problem work? [minor homework #1 due (released: 8/27)]

Sep. 3 Tue - Dynamic programming for the coin change problem. Knapsack (integer weights). [minor homework #2 due (released: 8/29)]
Sep. 5 Thu - Knapsack revisited (integer values). Longest increasing subsequence. [minor homework #3 due (released: 9/3)]

Sep. 10 Tue - Edit distance. Chain matrix multiplication.
Sep. 12 Thu - More dynamic programming problems.

Sep. 17 Tue - Review. [minor homework #4 due (released: 9/10)]
Sep. 19 Thu - EXAM #1 (topics: Greedy algorithms/Dynamic programming).

TOPIC: Graph algorithms, Linear Programming. (Major homework #2 due Oct. 10, Major homework #3 due Oct. 24, Major Homework #4 due Oct. 31, Exam #2 on Nov. 7.)

[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.

[CLRS] Chapter 29,
linear programming (Erickson).
[DPV] Chapter 7.

Problem sessions:

Oct. 7 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Dylan McKellips)
Oct. 8 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Joe Saber)
Oct. 8 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Colby Crews)
Oct. 9 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Yekai Pan)

Oct. 21 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Owen Tian)
Oct. 22 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Colby Crews)
Oct. 22 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Seif Mohamed)
Oct. 23 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Joe Saber)

Oct. 28 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Dylan McKellips)
Oct. 29 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Joe Saber)
Oct. 29 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Owen Tian)
Oct. 30 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Yekai Pan)

Nov. 4 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Owen Tian)
Nov. 5 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Colby Crews)
Nov. 5 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Seif Mohamed)
Nov. 6 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Joe Saber)

Sep. 24 Tue - Undirected graphs, finding connected components, DFS.
Sep. 26 Thu - Directed graphs, strong connectedness, linearization (topological sorting). [minor homework #5 due (released: 9/24)]

Oct. 1 Tue - Strongly connected components.[minor homework #6 due (released: 9/26)]
Oct. 3 Thu - BFS, Shortest paths (Dijkstra).

Oct. 8 Tue - Dealing with negative edge weights (Bellman Ford). Floyd-Warshal.
Oct. 10 Thu - Matchings I.

Oct. 15 Tue - FALL BREAK.
Oct. 17 Thu - Matchings II. [minor homework #7 due (released: 10/10)]

Oct. 22 Tue - Minimum spanning trees.
Oct. 24 Thu - Modeling with linear programs I (classical problems).

Oct. 29 Tue - Solving systems of equations (Gaussian elimination), solving systems on inequalities (Fourier-Motzkin elimination).
Oct. 31 Thu - Duality, Modeling with linear programs II (zero-sum games).

Nov. 5 Tue - Modeling with linear programs III. [minor homework #8 due (released: 10/24)]
Nov. 7 Thu - EXAM #2 (topics: Graph algorithms, Linear Programming)

TOPIC: Reductions (NP-completeness), Divide and Conquer Algorithms (FFT). (Major homework #5 due Nov. 21, Exam #3 on Dec. 5)

[CLRS] Chapter 34,
[Erickson] Chapter 12 (NP),
[DPV] Chapter 8.

[CLRS] Chapters 4, 9,30,
FFT (Erickson),
[DPV] Chapter 2.

Problem sessions:

Nov. 18 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Dylan McKellips)
Nov. 19 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Joe Saber)
Nov. 19 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Seif Mohamed)
Nov. 20 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Yekai Pan)

Dec. 2 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Owen Tian)
Dec. 3 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Colby Crews)
Dec. 4 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Seif Mohamed)
Dec. 4 (Wednesday) 7:40pm - 8:40pm in Hutchison Hall Room 473 (Joe Saber)

Nov. 12 Tue - Fast fourier transform, convolution I.
Nov. 14 Thu - Fast fourier transform, convolution II. [minor homework #9 due (released: 11/12)]

Nov. 19 Tue - NP completness, reductions I.
Nov. 21 Thu - NP completness, reductions II.

Nov. 26 Tue - NP completness, reductions III.
Nov. 28 Thu - THANKSGIVING (no class).

Dec. 3 Tue - Divide and conquer algorithms. [minor homework #10 due (released: 11/19)]
Dec. 5 Thu - EXAM #3 (topics: NP completness, divide and conquer algorithms (fast fourier transform)

Grading

The grade for the course is computed from the exam grade (75%) and the homework grade (25%).

Homework Rules

Homework will be submitted on Gradescope, the deadline is 11am on the date the homework is due.
There will be the following two types of homework.
- Major homework will require typeseting one or more of the following: algorithms, pseudocode, code, reasoning, proofs. Major homework is submitted on gradescope and will be graded by the TAs.
- Minor homework will be answering questions on gradescope. Minor homework will be autograded.
Major homework must be typeset (for example, you can use LaTeX, word, powerpoint (of course, any open office or google variants are fine), etc).
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 3 full-class exams. There are no make-up exams (except in the case of a medical emergency---in such a case we will use the university scheduled final exam time (Dec. 18, 4pm-7pm) to administer all the make-up exams).

This course follows The University Policy on Academic Honesty.