Formerly CSC 410 “Advanced Analysis of Algorithms”
Offered Every Semester
Course Units: 1
This course presents major principles of algorithm design and analysis, and applies those principles to classical problems in computer science. Topics include algorithm complexity analysis, data structures, divide and conquer, searching and sorting, greedy algorithms, graph search and traversal, bipartite matching, dynamic programming, approximate string matching, partitioning, and union-find.
Prerequisite notes: CSC 230, CSC 270, and MAT 127, each with a grade of C or higher. Non-majors may use CSC 250 in lieu of CSC 230.
Required for major/minor: Computer Science Major
Option for major/minor: Computer Science Minor