CS 515 - ALGORITHM DESIGN

Stanley and Karen Pigman College of Engineering

Credits: 3

The design and analysis of efficient algorithms and data structures for problems in sorting, searching, graph theory, combinatorial optimization, computational geometry, and algebraic computation. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy method, and randomization, approximation algorithms.

Prerequisite(s):
Prereq: CS 315 and engineering standing.