CSC 503: Design and Analysis of Algorithms

Offered Under: M.Sc. in Computer Science (CSC)

The study of complexity of algorithms: best case, worst-case and expected case analysis. Lower bound arguments; divide and conquer techniques; greedy algorithms. Computational complexity and intractability: Cook's Theorem. NP-completeness oracles and approximation. Polynomial hierarchy, heuristics.

Course Type Major
Credit Hour 3
Lecture Hour 45
Expected Outcome(s):

Suggested Books:

Grading Policy: