CS 2150 DESIGN & ANALYSIS OF ALGORITHMS

Description

Minimum Credits: 3
Maximum Credits: 3
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.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad LG/SNC Basis
Course Requirements: PLAN: Computer Science (CS-PHD; CS-MS; CSMSBS-MS) or Computer Engineering (COEAS-PHD; COEAS-MS; COEENG-PHD; COEENG-MCO)

Current Sections

Spring 2021

Class No.DaysTimesRoomInstructor(s)TA(s)TypeSession
25738 (1100)MW1:15 pm - 2:30 pmSENSQ 5502K. Pruhs
LECAT

Past Sections

Please click the headings below to view the hidden sections.