Changes

'''Course Information''' <br>

'''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.

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;"

{| style="text-align:left; width: 550PX;"

''' Hours Per Week ''' <br>

''' Hours Per Week ''' <br>

''' Recommended Prior Experience ''' <br>

''' Recommended Prior Experience ''' <br>

''' Projects, Exams, or other Assessments ''' <br>

''' Projects, Exams, or other Assessments ''' <br>

[https://www.cs.umd.edu/class/spring2016/cmsc451/syllabus.pdf Spring 2016], syllabus.

[https://www.cs.umd.edu/class/spring2015/cmsc451/ Homework are here].

''' Misc Info ''' <br>

''' Misc Info ''' <br>