CS 420  Introduction to Analysis of Algorithms  Credits: 4 (3-0-1)

Course Description: Efficiency analysis, correctness proofs, design strategies, illustrations from domains such as graph theory, scheduling and optimization, geometry.
Prerequisite: CS 320 with a minimum grade of C.
Registration Information: Must register for lecture and recitation. Sections may be offered: Online.
Term Offered: Fall.
Grade Mode: Traditional.
Special Course Fee: No.