COMP SCI 450. Theory of Algorithms. 3 Credits.
Design, analysis and comparison of algorithms; divide and conquer techniques, greedy method, dynamic programming and smart searching. Applications to optimization with constraints and decision problems. Theory of computability including examples of NP-complete problems such as the "traveling salesman" problem.
P: 18 credits in COMP SCI, COMM or INFO SCI
...into ENG COMP 164, English...Reading score: 450-580 OR...99 , COMM SCI 205 , or...