This course is an extension to the process of algorithmic thinking and the mathematics of computer science. Topics include asymptotic analysis, and various algorithmic strategies including dynamic programming, greedy algorithms, amortized analysis, linear and integer programming, randomized algorithms, and approximation algorithms. Emphasis will be placed on understanding underlying mathematics, such as discrete probability, statistics, graph, and set theory. Credits: 4
Prerequisite: CSC 6013