MATH 3030 - Discrete Structures

(3) Credit Hours

Concepts and techniques of several areas of discrete mathematics with emphasis on areas often applied to computer science. Topics will include formal logic, induction, recursion, algorithms, counting methods, languages and grammars, and finite state machines. Fall and spring semesters. Prerequisites: MATH 1920 or MATH 1960 and CPSC 1100 with minimum grades of C or department head approval. Standard letter grade.