CECS 628 - Advanced Analysis of Algorithms

(3 units)

Prerequisites: Open to Computer Science MS, Computer Engineering MS, or Engineering MS students only.
Theoretical analysis of algorithms. Divide and conquer, dynamic programming and greedy algorithms; basic search and traversal techniques including search trees; sorting; matrix manipulations; NP-completeness. Master’s students register in CECS 528 or CECS 628; Ph.D. students register in CECS 628. Additional projects required for CECS 628.

Letter grade only (A-F). (Lecture-problems 3 hours) Double Numbered with: CECS 528