Mar 03, 2026  
2020-2021 Catalog Volume XXX Ver 2 
    
2020-2021 Catalog Volume XXX Ver 2 [ARCHIVED CATALOG]

CST 4000 Analysis of Algorithms


Lecture: 2 Lab: 2.5 Practica: 0 Total Credits: 4.5
This course covers techniques for the evaluation and design of efficient algorithms including evaluating options and tradeoffs for sorting, search trees, heaps, and hashing. Additional advanced algorithm techniques are introduced including divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, graph algorithms, and shortest paths.

Prerequisite(s): CST 2200 with a grade of C or better