COSC 312 Design and Analysis of Algorithms

This course covers the most important algorithm strategies and solution techniques, independent of programming language or computer hardware. Topics include: Big-O notation; worst and average case analysis; recurrences and asymptotics; efficient algorithms for sorting, searching, and selection; algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, randomization; algorithms for fundamental graph problems; string algorithms; and numerical methods.

Credits

3

Prerequisite

COSC 301, COSC 310

Offered

Spring