• Course Code: CMPS651
  • Credits: 3
  • Hours Distribution: (3Crs.: 3Lec.)
  • Course Type: Elective Courses (EC)

Course Description

A course that discusses complexity classes of algorithms, especially those arising from time and space analysis of bounded computations. Topics include sequential, deterministic, parallel, and non-deterministic models of computation, and the hierarchy of complexity classes.