Algorithm Design and Analysis

Algorithm Design and Analysis
A study of the design and analysis of algorithms as solutions to problems, including dynamic programming, linear programming, greedy algorithms, divide-and-conquer algorithms, graph algorithms, and intelligent search algorithms.
C S
312
 Hours3.0 Credit, 3.0 Lecture, 0.0 Lab
 PrerequisitesC S 240 & C S 252; or C S 240 & BIO 365
 TaughtFall, Winter
 ProgramsContaining C S 312
Course Outcomes

Please contact the individual department for outcome information.