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: 3

Prerequisites

Requirements and Grading

Current Sections

Spring 2019

Class No.
Days
Times
Room
Instructor(s)
TA(s)
Type
Session
Writing
Class No.: 27573 (1100)
Days: MW
Times: 1:00 pm - 2:15 pm
Room: IS 406
Instructor(s): K. Pruhs
TA(s):
Type: LEC
Session: AT
Writing:

Past Sections

Please click the headings below to view the hidden sections.