CSCE 4110 - Algorithms

3 hours

Time complexity of algorithms; algorithm design methodologies including divide and conquer, greedy, and dynamic programming; exposure to approximation algorithms for NP-hard problems; performance evaluation of algorithms.

Prerequisite(s): CSCE 3110 with a C or better.