CS 2130 - Computational Structures

Credits: (4)
Typically taught:
Fall [Full Sem, Online]
Spring [Full Sem]
Summer [Full Sem, Online]

Advanced principles of discrete computational models and algorithm analysis. Topics include: the design of efficient algorithms, order statistics, set manipulation problems, Turing machines, graph algorithms, matrix operations, integer and polynomial arithmetic, combinatorics, and pattern matching algorithms. Emphasis will be on the application of abstract models in a discrete software computational context. Prerequisite: CS 1400.