Design and analysis of computer algorithms. Divide-and-conquer, dynamic programming, greedy method, backtracking. Algorithms for sorting, searching, graph computations, pattern matching, NP-complete problems. Course Information: Same as MCS 401. 3 undergraduate hours. 4 graduate hours. Prerequisite(s): Grade of C or better in MCS 360; or Grade of C or better in CS 251.
...CS 342 , CS 411 , CS 412 , CS 418 , CS 422 , or MCS 401 / CS 401...
...3 CS 111 (3 hours) 4-5 CS...181 , MATH 215 , STAT 401 (14 hours) Media...
...STAT 401 . b Students may choose to use MCS 471 as either a CS technical...
...STAT 401 . b Students may choose to use MCS 471 as either a CS technical...
...courses provided by the CS department. c This...STAT 381 or STAT 401 . Free Electives Sample...
Print this page.
All the pages in the Graduate & Professional Catalog/gcat