UMBC CMSC641-01, Design & Analysis of Algorithms, Spring 2023

News Archive

• [Mon May 08 10:00 2023]   Homework 13 posted. Due Tue 05/16/22   [Submit]

• [Mon May 08 09:20 2023]   Prof. Chang's office hours on Thursday, May 11th shifted to 2:30pm – 4pm (instead of 3:00pm - 4:30pm).

• [Wed May 03 16:20 2023]   Updated class schedule

• [Mon May 01 10:28 2023]   Homework 12 posted. Due Tue 05/09/22   [Submit]

• [Mon Apr 24 16:05 2023]   Homework 11 posted. Due Tue 05/02/22   [Submit]

• [Tue Apr 18 00:50 2023]   Homework 10 posted. Due Tue 04/25/22   [Submit]

• [Mon Apr 10 22:50 2023]   Homework 9 posted. Due Tue 04/18/22   [Submit]

• [Mon Apr 03 22:20 2023]   Homework 8 posted. Due Tue 04/11/22   [Submit]

• [Mon Mar 27 21:30 2023]   Prof. Chang's office hours on Wednesday, March 29 has moved to the morning: 10am – 11:30am (originally 1:30pm – 3pm).

• [Mon Mar 27 11:05 2023]   Homework 7, Due Tue 04/04/22   [Submit]

• [Tue Mar 14 11:55 2023]   Updated the class schedule to reflect the new dates for tests after Spring break:
  • Test 3 (Thu 4/13) Network Flow
  • Test 4 (Thu 4/27) NP-Completeness
  • Test 5 (Thu 5/11) Approximation Algorithms

• [Mon Mar 06 23:25 2023]   Homework 6 posted. Due Tue 03/14/22   [Submit]

• [Mon Feb 27 16:10 2023]   Homework 5 posted. Due Tue 03/07/22   [Submit]

• [Mon Feb 20 16:45 2023]   Updated Homework 4 with some clarifications. Please use Version 1.1.

• [Mon Feb 20 14:50 2023]   Homework 4 posted. Due Tue 02/28/22   [Submit]

• [Thu Feb 16 11:45 2023]   Fixed small typo in Homework 3 (had "Homework 2" up top).

• [Sun Feb 12 12:10 2023]   Homework 3 posted. Due Tue 02/21/22   [Submit]

• [Mon Feb 06 14:10 2023]   Homework 2 posted. Due Tue 02/14/22   [Submit]

• [Thu Feb 02 16:50 2023]   Prof. Chang's office hours on Tuesday Feb 14 moved to 3:30pm - 5pm (from 3pm - 4:30pm).

• [Tue Jan 31 12:35 2023]   Here is the article in the January 2023 issue of the Communications of the ACM, The End of Programming, where the author Matt Welsh says:

  I am not sure I remember how to implement Quicksort myself.

  I remembered incorrectly myself, as well. He only worked at Cornell, but got his PhD from Berkeley. Maybe that explains it. Here's Quicksort in Haskell, to jog his memory: qsort [] = [] qsort (x:xs) = qsort smaller ++ [x] ++ qsort larger where smaller = [ a | a <- xs, a <= x ] larger = [ b | b <- xs, b > x ]

• [Tue Jan 31 12:35 2023]   Recordings of lecture are placed in the Recorded Lectures directory on Google Drive. I will upload the mp4 file soon after class, but it might take Google some time to process the file.

• [Tue Jan 31 12:30 2023]   Our TA, Abhishek Chintalapati, will start online office hours next week, on Mondays & Wednesdays 10:30am – 11:30am. Use his WebEx room at: https://umbc.webex.com/meet/abhishc1. This information is available on the Contacts page and also on the class calendar.

• [Mon Jan 30 15:50 2023]   Fixed small typo in Homework 1 (now v1.1)

• [Mon Jan 30 14:30 2023]   Homework 1 posted. Due Tue 02/07/22   [Submit].

• [Mon Jan 30 14:00 2023]   Syllabus & schedule also availalbe in PDF.

• [Mon Jan 30 12:45 2023]   Prof. Chang's office hours on Thursday Feb 9 moved to 4:30pm - 6pm.

• [Thu Jan 26 16:00 2023]   Web page up.