Computer Science 282/482

Design and Analysis of Efficient Algorithms

Fall 2023

Instructor: Daniel Stefankovic
Class: Tuesday, Thursday 11:05am-12:20pm, Wegmans 1400.

Instructor office hours: ONLINE (zoom link on blackboard) Monday 8:00pm-9:00pm and Wednesday 8:00pm-9:00pm.
TA (Masum Hasan) office hours: Monday 4:00pm-5:00pm, Wegmans 2309 and Wednesday 4:00pm-5:00pm, Wegmans 2309.

TAs: Yoo (Daniel) Choi, Masum Hasan, Yekai Pan, Grayson Westfall (email addresses available on blackboard).

Problem sessions (only in weeks with exams or when homework is due; full schedule is below):
• Monday 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Tuesday 6:15pm - 7:15pm Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Wednesday 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)

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, Linear Programming. (Homework #1 due Sep. 14, Homework #2 due Sep. 28, Exam #1 on Oct. 5.)

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


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

Problem sessions:

• Sep. 11 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Sep. 12 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Sep. 13 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)
• Sep. 25 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Sep. 26 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Sep. 27 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)
• Oct. 2 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Oct. 3 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Oct. 4 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)

Aug. 31 Th - Introduction.


Sep. 5 Tu - When does greedy algorithm for the coin change problem work?
Sep. 7 Th - Dynamic programming for the coin change problem. Knapsack (integer weights).


Sep. 12 Tu - Knapsack revisited (integer values). Longest increasing subsequence.
Sep. 14 Th - Edit distance. Chain matrix multiplication.


Sep. 19 Tu - More dynamic programming problems.
Sep. 21 Th - Modeling with linear programs I (classical problems).


Sep. 26 Tu - Solving systems of equations (Gaussian elimination), solving systems on inequalities (Fourier-Motzkin elimination).
Sep. 28 Th - Duality, Modeling with linear programs II (zero-sum games).


Oct. 3 Tu - Modeling with linear programs III.
Oct. 5 Th - EXAM #1 (topics: Greedy algorithms/Dynamic programming/Linear Programming).


TOPIC: Graph algorithms. (Homework #3 due Oct. 26, Homework #4 due Nov. 2, Exam #2 on Nov. 9.)

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.

Problem sessions:

• Oct. 23 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Oct. 24 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Oct. 25 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)


• Oct. 30 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Oct. 31 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Nov. 1 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)


• Nov. 6 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Nov. 7 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Nov. 8 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 3100 (Grayson Westfall)


Oct. 10 Tu - Undirected graphs, finding connected components, DFS.
Oct. 12 Th - Directed graphs, strong connectedness, linearization (topological sorting).


Oct. 17 Tu - FALL BREAK (no class).
Oct. 19 Th - Strongly connected components.


Oct. 24 Tu - BFS, Shortest paths (Dijkstra).
Oct. 26 Th - Dealing with negative edge weights (Bellman Ford). Floyd-Warshal.


Oct. 31 Tu - Matchings I.
Nov. 2 Th - Matchings II.


Nov. 7 Tu - Minimum spanning trees.
Nov. 9 Th - EXAM #2 (topics: Graph algorithms)


TOPIC: Reductions (NP-completeness), Divide and Conquer Algorithms. (Homework #5 due Nov. 30, Exam #3 on Dec. 12)

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


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

Problem sessions:

• Nov. 27 (Monday) 6:15pm - 7:15pm in Hylan Building Room 202 (Yekai Pan)
• Nov. 28 (Tuesday) 6:15pm - 7:15pm in Goergen Hall Room 109 (Yoo (Daniel) Choi)
• Nov. 29 (Wednesday) 6:15pm - 7:15pm in Gavett Hall Room 310 (Grayson Westfall)


Nov. 14 Tu - Fast fourier transform, convolution I.
Nov. 16 Th - Fast fourier transform, convolution II.

Nov. 21 Tu - (online/zoom class) NP completness, reductions I.
Nov. 23 Th - THANKSGIVING (no class).

Nov. 28 Tu - NP completness, reductions II.
Nov. 30 Th - NP completness, reductions III.

Dec. 5 Tu - Divide and conquer algorithms I.
Dec. 7 Th - Divide and conquer algorithms II.

Dec. 12 Tu - EXAM #3 (topics: NP completness, fast fourier transform, divide and conquer algorithms)

Grading

• The grade for the course is computed from the exam grade (60%) and the homework grade (40%).

Homework Rules

• Homework will be submitted on Gradescope, the deadline is 11am on the date the homework is due.
• There will be the following three 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 case we will use the university scheduled final exam time (Dec. 21, 4pm-7pm) to administer the make-up exams).

This course follows The University Policy on Academic Honesty.