Course Description

CS 381 covers mathematical aspects of the analysis and design of algorithms, recurrences, sorting, graphs and digrpahs, dynamic programming and approximate algorithms.