CMSC 441, Course Homepage, All Sections
Design and Analysis of Algorithms
Course Goals
In this course, you will learn how:
- to design new algorithms based on standard algorithm-design strategies
(scanning, divide-and-conqurer, dynamic programming, greedy, precomputation, time-space tradeoff, transformation, randomization, branch-and-bound, exhaustive search, approximation)
- to analyze the time and space usage and correctness of
new algorithms based on standard algorithm-analysis techniques
(set up and solve summation, set up and solve recurrence, count by object
vs. count by lines of code, proofs by induction, asymptotic notations)
- to apply and adapt fundamental algorithms
(sorting, searching, order statistics, graph algorithms, integer arithmetic,
and selected combinatorial tasks)
to new situations
- to solve problems and to express your solutions using
the language and concepts of algorithms and
its mathematical tools.
Minimal Required Work (all sections)
There will be weekly homework problems to be solved in writing,
two tests, and a comprehensive final examination. In class quizzes
may be substituted for homework assignments.
Fall 2003
Fall 2001
Previous Semesters
-
Spring 2001, Prof. Sherman
-
Fall 2000, Prof. Kalpakis
-
Spring 2000, Prof. Kalpakis
-
Fall 1999, Prof. Richard Chang
-
Fall 1999, Maitreyee Pasad
-
Spring 1999, Prof. Kalpakis
-
Fall 1998, Prof. Sherman
-
Fall 1998, Prof. Kalpakis
-
Spring 1997, Prof. Richard Chang
-
Spring 1997, Prof. Alan T. Sherman
-
Fall 1996, Prof. Richard Chang
-
Fall 1996, Prof. Alan T. Sherman
-
Spring 1996, Prof. Chang
-
Spring 1995, Prof. Sherman
Other Course Notes
Last Modified:
August 31, 1998
Richard Chang, chang@gl.umbc.edu