Mar 28, 2024  
2020-2021 Undergraduate and Graduate Catalog 
    
2020-2021 Undergraduate and Graduate Catalog [ARCHIVED CATALOG]

CECS 428 - Analysis of Algorithms


(3 units)

Prerequisite: CECS 328  with a grade of “C” or better.
Applications of standard combinatorial techniques to applied programming problems. Rigorous analysis of correctness/complexity of algorithms. Advanced graph algorithms are emphasized. Topics include shortest paths on graphs, sorting, string matching, union find problem, divide-and-conquer technique, and weighted-edge problem.

Letter grade only (A-F). (Lecture 2 hours, laboratory 3 hours)