Discrete Mathematics

Catalog description

Study of formal logic; sets; functions and relations; principle of mathematical induction; recurrence relations; and introductions to elementary number theory and graph theory; counting (basic combinatorics); asymptotic complexity of algorithms; and NPcompleteness. This course is useful to those taking graduate classes in computer science. It also helpful to secondary teachers by giving them a better understanding of the terms and ideas used in modern mathematics. This is an elective course, eligible for the non-thesis option of the MS degree in math only. The maximum credit hours can be earned towards the MS degree in math among MATH 500 , 550, 560 is six. Prerequisites: A grade of C or better on MATH 2414 .