1,309 bytes added
, 22:40, 2 October 2016
'''Course Information''' <br>
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.
{| style="text-align:left; width: 550PX;"
! Instructor
! Section
! Day & Time
! Location
|- style="vertical-align:top;" |
| Jessica Change, Samir Khuller || style="vertical-align:top;" | 0101 || TuTh 5:00PM - 6:15PM || style="vertical-align:top;" | [http://maps.umd.edu/map/index.html?Welcome=False&MapView=Detailed&LocationType=Building&LocationName=406 CSI 3117]
|}
''' Course Prerequisite(s) ''' <br>
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 ''' <br>
[https://www.cs.umd.edu/class/spring2016/cmsc451/ Spring 2016].
''' Hours Per Week ''' <br>
''' Languages Used ''' <br>
''' Recommended Prior Experience ''' <br>
''' Projects, Exams, or other Assessments ''' <br>
[https://www.cs.umd.edu/class/spring2016/cmsc451/syllabus.pdf Spring 2016], syllabus.
''' Misc Info ''' <br>