MATH 1450 - Discrete Mathematical Structures

Sets, functions, relations, graphs, digraphs, trees, recursion, mathematical induction and other proof techniques, counting techniques, Boolean Algebras and asymptotic analysis of algorithms. The relationship of these concepts with computer science will be emphasized.

Prerequisites & Corequisites: Prerequisites: MATH 1220 or MATH 1700, and an introductory programming course.

Credits: 3 hours