Course Information


CSC 4200: Advanced Algorithms and Complexity

Credits: 3 Level: undergraduate


Description:

Greedy algorithms, divide-and-conquer; dynamic programming; backtracking; branch-and-bound; linear and integer programming; Fast Fourier Transforms; probabilistic algorithms; NP-complete problems and approximation methods.

Course Outcomes:
  • Reinforce and expand on the material of CSC 1700, focusing on algorithms that were not previously covered, including approximation methods, probabilistic algorithms, and Fast Fourier Transforms.

  • Establish an understanding of approaches for proving algorithm optimality.

Prerequisites:

CSC 1700