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 #13278 Course information

3.00 credits
Section 7101: Graduate Lecture
Class: #13278

Fall Full Semester
Sep 2, 2026 - Dec 17, 2026
Instructor(s): 
Cost: $
 Status: 
MON TUE WED THU FRI SAT
Location: Online
Textbook Syllabus
MONNTUESNWEDNTHURSNFRINSATN