CSC 5033 - Introduction to Theory of Algorithm

3 Credit Hours

This course extends students’ knowledge on mathematical analysis of algorithm complexity. Topics include advanced data structures, divide and conquer, greedy algorithms, dynamic programming and approximation algorithms and, algorithm applications in different problem domains, such as graph, sorting, and optimization problems, and NP-complete problems.

Prerequisite: CSC 2253 Discrete Structure and CSC 2403 Algorithm Design and Analysis
Availability: Fall

View textbook information.