CSC 140. Advanced Algorithm Design and Analysis. Algorithm design using dynamic programming, randomization and greedy methods. Analysis using recurrence relations and amortization. String and network-flow algorithms. NP-completeness, reductions, and approximation algorithms. Review of divide-and-conquer design and asymptotic notation. Prerequisite: CSC 130. Graded: Graded Student. Units: 3.0.