CSCE 5150 - Analysis of Computer Algorithms

3 hours

Study of efficient algorithms for various computational problems. Topics include advanced techniques of algorithm design: divide-and-conquer, the greedy method, dynamic programming, search and traversal, back-tracking and branch-and-bound. Other topics include NP-Completeness theory, including approximation algorithms and lower bound theory, and probabilistic algorithms.

Prerequisite(s): None.

Course specific fees (in addition to tuition and mandatory):
Academic (AF) per hour: $73.67