CS 301 Algorithms Select Term:
This course will cover algorithms for a variety of problems, as well as general algorithm design and analysis techniques such as divide-and-conquer, dynamic programming, and greedy algorithms. Specific topics include algorithm analysis, recurrences and asymptotic analysis; searching, sorting; algorithms for fundamental graph problems, such as depth-first search,connected components,topological sort,shortest paths.
SU Credits : 3.000
ECTS Credit : 6.000
Prerequisite : ( Undergraduate level MATH 204 Minimum Grade of D AND Undergraduate level CS 300 Minimum Grade of D )
Corequisite : CS 301