|Undergraduate Course Details|
|Prerequisites||MAT210 or MAT220|
A study of discrete mathematical structures of interest in computer science and other applied fields. Topics will be chosen from logic, proof techniques, sets, boolean algebra, functions, relations, basics of counting, recursion, graphs, trees, and discrete probability. Four lecture hours per week. Not open to students who have received credit for either MAT214 or MAT314.