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. Lect: 3 hrs./Lab: 1 hr. Prerequisites: (CPS 305 and MTH 210) or CPS 411 Course Weight: 1.00 Billing Units: 1
