CMSC 441 — Design and Analysis of Algorithms
This course studies fundamental algorithms, strategies for designing algorithms, and mathematical tools for analyzing algorithms. Algorithm design strategies include the greedy method, divide-and-conquer, and dynamic programming. Students will learn to design new algorithms based on standard design strategies, to analyze the time and space usage and correctness of algorithms, to apply and adapt fundamental algorithms to new problems, and to solve problems and to express their solutions using the language and concepts of algorithms and related mathematical tools.
Be sure to read through the syllabus for more information.
| Section | Days | Time | Location |
|---|---|---|---|
| 02 | TuTr | 10:00 – 11:15 | Sherman 150 |
| 03 | TuTr | 1:00 – 2:15 | ITE 227 |