MTH-215 Discrete Mathematics

Introduction to analysis of finite collections and mathematical foundations of sequential machines, computer system design, data structures and algorithms. Course material includes sets, counting, recursion, graph theory, trees, Boolean algebra, automata, and formal grammar and languages. (3 contact hours)

Credits

3

Prerequisite

MTH-141 with a minimum grade of "C" or appropriate placement test score

Department

Mathematics

IAI Code

M1905 and CS915