CPS 616
Advanced Algorithms
Order notations, the greedy method, job scheduling, correctness, exchange argument, divide and conquer techniques, recurrence equations, the master method, integer multiplications, dynamic programming, matrix chain-product, the knapsack problem, graph algorithms (minimum spanning trees, single-source shortest paths, all-pairs shortest paths), text processing and pattern matching techniques, approximation algorithms.
Weekly Contact: Lab: 1 hr. Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1
Mentioned in the Following Calendar Pages
*List may not include courses that are on a common table shared between programs.