MAT 413
Discrete Math for Computr Sci

Background to understanding computer science as the science of clear and concise descriptions of computable, discrete sets. Provides conceptual tools useful for any advanced study in computer science. Topics include: review of set theory, logic and relational calculus, algebraic structures (lattices, Boolean algebra, semi groups, groups, rings, etc.) and morphisms and their application in computer science (automata theory, coding, switching theory, etc.), formal languages and their acceptors, and elements of information theory and of the theory of computability. Prerequisite: CS 108.

Return