Design and Analysis of Algorithms

COMPSCI 532

Design and analysis of efficient algorithms. Algorithmic paradigms. Applications include sorting, searching, dynamic structures, graph algorithms, randomized algorithms. Computationally hard problems. NP completeness. Prerequisites: Computer Science 201 and 330 or equivalent.
Curriculum Codes
  • QS
Typically Offered
Fall Only