CS 1310 - Foundations of Computer Science

Covers fundamental concepts in discrete mathematics and introduction to automata theory. Topics include: sets, functions, relations, proof techniques, graphs and trees, sequences, asymptotic behavior, counting and probability. Will also include an introduction to automata, regular expressions and grammars, machine representations of integer and real numbers. Algorithms related to the course topics will be introduced and implementations examined and their efficiency considered.

Prerequisites & Corequisites: Prerequisite: MATH 1180 , MATH 1220 or MATH 1700 and some programming experience.

Credits: 4 hours