Difference between revisions of "CMSC451 - Design and Analysis of Computer Algorithms"
From CS 400 Level Course Wiki
(Created page with "'''Course Information''' <br> Fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics inc...") |
(No difference)
|
Revision as of 22:40, 2 October 2016
Course Information
Fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics include sorting, selection, 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 |
|---|---|---|---|
| Jessica Change, Samir Khuller | 0101 | TuTh 5:00PM - 6:15PM | CSI 3117 |
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
Languages Used
Recommended Prior Experience
Projects, Exams, or other Assessments
Spring 2016, syllabus.
Misc Info
