Changes
From CS 400 Level Course Wiki
1,251 bytes added
, 20:32, 4 April 2017
'''Course Information''' <br>
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.
{| style="text-align:left; width: 550PX;"
! Instructor
! Section
! Day & Time
! Location
|- style="vertical-align:top;" |
| Mohammad Hajiaghayi
|| style="vertical-align:top;" | 0101 || MW 2:00pm - 3: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>
''' Hours Per Week ''' <br>
''' Languages Used ''' <br>
''' Recommended Prior Experience ''' <br>
''' Projects, Exams, or other Assessments ''' <br>
''' Misc Info ''' <br>
[http://www.cs.umd.edu/~hajiagha/474GT15/Lecture09032013.pdf Introduction to Game Theory Lecture]