CST 5320 - Design and Analysis of Algorithms Methods

Credits: 3 hrs

Covers the design and analysis of efficient algorithms and algorithmic paradigms. The orientation of the course is toward algorithms likely to be of practical use. These algorithms cover fundamental and more advanced methods along with analytic results. Applications include sorting, searching dynamic structures, graph algorithms, parallel algorithms, computationally hard problems, and NP completeness. Prerequisite(s): Admission to the MS in Computer Science and Information Technology (MCST) graduate program and advisor approval