COSC 31 Algorithms
A survey of fundamental algorithms and algorithmic techniques, including divide-and-conquer algorithms, dynamic programming, randomized algorithms, greedy algorithms, and graph algorithms. Presentation, implementation and formal analysis, including space/time complexity and proofs of correctness, are all emphasized.
Instructor
Chakrabarti (Winter)
Prerequisite
COSC 10 and
COSC 30. Students who have not taken
COSC 30 but have a strong mathematical background may take COSC 31 with the instructor's permission.