CSCI 256: Algorithm Design and Analysis (Q)

This course explores advanced concepts in algorithm design, algorithm analysis and data structures. Areas of focus will include algorithmic complexity, randomized and approximation algorithms, geometric algorithms, and advanced data structures. Topics will include combinatorial algorithms for packing, and covering problems, algorithms for proximity and visibility problems, linear programming algorithms, approximation schemes, hardness of approximation, search, and hashing.

Format: Lectures. Evaluation will be based on problem sets and programming assignments, and midterm and final examinations.

Prerequisites: CSCI 136 and MATH 200.

Course webpage: Click here!

Taught by: Heeringa, Lenhart

Scheduled offerings:

Spring 2017
256-01 (LEC) MWF 10:00-10:50

Past offerings:
Spring 2016
256-01 (LEC) MWF 10:00-10:50

Spring 2015
256-01 (LEC) MWF 10:00-10:50

Spring 14
256-01 (LEC ) MWF 12:00-12:50