Faculty member proposing: Seungjin Park

Email address: spark@mtu.edu

Course syllabus:

Knowledge  Algorithms  Familiarity  Exposure     Amortized Analysis     Divide-and-Conquer     Dynamic Programming     Graph Algorithms     Approximation Algorithms     Computational Complexity	Skills  Algorithms  Familiarity  Exposure     Analytical techniques for determining the cost of algorithms are discussed.    Algorithm design techniques including divide-conquer and dynamic programming are discussed.    Applications of graph search techniques are presented.    Performance bounds for approximation algorithms are introduced.    The notation of difficult problems is defined. Mastery     The student will be able to design efficient algorithms for problems by applying algorithm design techniques to the problems.    The student will be able to determine the cost of algorithms by applying analytical techniques.    The student will be able to show that some problems are computationally difficult.
Area 2  Mastery  Familiarity  Exposure	Area 2  Mastery  Exposure  Familiarity
Area 3  Familiarity  Exposure	Area 3  Familiarity
Area 4  Familiarity  Exposure  Mastery	Area 4  Familiarity  Exposure  Mastery