CIS 522: Algorithms & Complexity

Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems. Requires pre-knowledge from an undergraduate course on algorithms and data structures.

Class #14504 Course information

3.00 credits
Section 7101: Graduate Lecture
Class: #14504

Spring Full Semester
Jan 26, 2026 - May 13, 2026
Instructor(s): 

Cost: 
$
Status: 
MON TUE WED THU FRI SAT
Location: Online
MONNTUESNWEDNTHURSNFRINSATN