CS 2150 DESIGN & ANALYSIS OF ALGORITHMS
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)
Minimum Credits: 3
Maximum Credits: 3
Please click the headings below to view the hidden sections.
|25497 (1100)||MW||1:00 pm - 2:15 pm||SENSQ 5313||K. Pruhs||LEC|