CS 2150 DESIGN & ANALYSIS OF ALGORITHMS

Description

This course deals with the analysis of algorithms and the relevance of such analysis to the design of efficient algorithms. The derivation of results that are primarily of theoretical significance shares importance with the practical task of designing efficient algorithms. Topics covered: searching and sorting, graph algorithms, arithmetic, NP-completeness, and lower bound techniques.

  • Credits: Variable
  • Frequency: Every term

Prerequisites

Requirements and Grading

Past Sections

To view the sections for a term, click on it's name below.

Spring 2017

Class Number Days Hours Room Instructor TA/Grader Dept/Limit Type Session Writing
24221 MWF 1:00 pm - 2:15 pm SENSQ 5313 K. Pruhs
N. Ong
CS/25 LEC TERM