CMSC451 - Design and Analysis of Computer Algorithms
Course Information
This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics include graph algorithms, and basic algorithm design paradigms (such as divide-and-conquer, dynamic programming and greedy algorithms), lower bounds and NP-completeness.
| Instructor | Section | Day & Time | Location |
|---|---|---|---|
| David Mount | 0101 | TuTh 3:30pm - 4:45pm | CSI 2117 |
Course Prerequisite(s)
Prerequisite: Minimum grade of C- in CMSC351; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.
Class Webpage
Spring 2016.
Hours Per Week
5 hours/week
Languages Used
Recommended Prior Experience
An ability to write proofs, think creatively.
Projects, Exams, or other Assessments
Homework are here.
Misc Info
Critical course for developing algorithms, learning dynamic programming and doing well in Google interviews!
