UMBC CMSC441, Design & Analysis of Algorithms, Spring 2009

News Archive

• [Tue May 26 11:20 2009]
  Grades for the final exam and students' letter grade for the class have been posted on Blackboard.

  FYI, the average score on the final exam was 98.0/120 (=81.66%) with a standard deviation of 11.0.

• [Thu May 07 16:27 2009]
  There will be 4 questions on the final exam (on Tuesday, May 19, 10:30am–12:30pm):
  1. Recurrence Relations
  2. Dynamic Programming
  3. Greedy Algorithms
  4. Graph Algorithms (not including maximum flow)

  The Quiz 1 crib sheet will be provided.

• [Thu Apr 30 15:44 2009]
  Fixed a bunch of typos in Question 3 of Homework 13. Added a note to Question 2.

• [Thu Apr 30 01:30 2009]
  Homework 13 posted.

• [Thu Apr 23 00:24 2009]
  Homework 12 posted.

• [Thu Apr 16 09:25 2009]
  Quiz 4 Reminder: Quiz 4 is Tuesday, April 21. The topic of the quiz is greedy algorithms. You will be asked to prove that a given greedy algorithm produces the optimum solution.

• [Thu Apr 16 09:25 2009]
  Homework 11 posted.

• [Wed Apr 08 23:09 2009]
  Homework 10 posted.

• [Thu Apr 02 12:45 2009]
  Quiz 3, scheduled for Tuesday April 7, will be on dynamic programming.

• [Thu Apr 02 08:32 2009]
  Homework 9 posted.

• [Thu Mar 26 23:25 2009]
  Our TA, Deepak Chinavle, moved his office hours to a new location: ITE353. The time for the office hours is still Wednesdays 4pm - 6pm.

• [Wed Mar 25 23:25 2009]
  Homework 8 posted.

• [Thu Mar 12 09:30 2009]
  Homework 7 posted.

• [Thu Mar 05 11:34 2009]
  Homework 6 posted.

• [Tue Mar 03 12:25 2009]
  Clarification: For the second problem in Homework 5, the one on k-quantiles, the set you are given is not sorted.

  If you were given a sorted set, then you can find the k-quantiles just by looking at the numbers in the n/k, 2n/k, 3n/k, ... positions of the sorted array. Then you have a O(k) time algorithm.

  For an unsorted set, you can run Select() k times on the original array. This takes O(n) time per call, resulting in a O(nk) time algorithm. The question is asking you to reduce this running time to O(n lg k).

• [Thu Feb 26 09:06 2009]
  Homework 5 posted.

• [Thu Feb 19 09:15 2009]
  Homework 4 posted.

• [Wed Feb 18 21:20 2009]
  A crib sheet with the Master Theorem, summations and log identities will be available during Quiz 1. You can have a look at the crib sheet now: crib.pdf

• [Thu Feb 12 07:45 2009]
  Homework 3 posted.

• [Wed Feb 04 23:08 2009]
  Homework 2 posted.

• [Tue Feb 03 12:55 2009]
  Our TA, Deepak Chinavle, has to shift his office hours by 45 minutes. His new office hours are:

  Wednesdays 4:00pm – 6:00pm in ITE 334.

  The contacts page has been updated.

• [Fri Jan 30 09:20 2009]
  Fixed typos in Homeworks page. Homeworks are due on Thursdays, not Tuesdays. The dates were correct.

• [Thu Jan 29 16:37 2009]
  Our TA, Deepak Chinavle, has office hours on Wednesdays 3:15pm – 5:15pm in ITE 334. The contacts page has been updated.

• [Wed Jan 28 23:55 2009]
  Homework 1 posted.

• [Tue Jan 20 14:17 2009]
  Course description and syllabus are available in PDF: 441description.pdf, 441syllabus.pdf.
  Hard copies will also be distributed on the first day of class.

• [Tue Jan 20 14:00 2009]
  Students on the hold list have been allowed to add. This class is now considered full.

• [Fri Jan 16 23:45 2009]
  Note: Be aware of the schedule of in-class quizzes listed in the syllabus! Quiz 1 will take place on Tuesday, February 24.

• [Fri Jan 16 23:45 2009]
  Web page up.