Search Results

COMPĀ SCIĀ 2500 Algorithms (LEC 3.0)

Students will solve recurrence relations, analyze algorithms for correctness and time/space complexity, apply these analysis techniques to fundamental dynamic programming, greedy, shortest-path, minimal spanning trees, and maximum flow algorithms and validate these analyses through programming. Prerequisite: A "C" or better grade in both Comp Sci 1200 and Comp Sci 1510; preceded by "C" or better grade in either Math 1208 or Math 1214, or accompanied by either Math 1208 or Math 1214.

Computer Science

http://catalog.mst.edu/undergraduate/degreeprogramsandcourses/computerscience/

...COMP SCI 3100 , COMP SCI 2200 , COMP SCI 3200 , COMP SCI 2300 , COMP SCI 2500...

Computer Engineering

http://catalog.mst.edu/undergraduate/degreeprogramsandcourses/computerengineering/

...COMP SCI 1570 , COMP SCI 1580 , COMP SCI 1575 , COMP SCI 1200 , COMP SCI 2500...