MAT 311 Discrete Math
This course provides an introduction to discrete mathematics. The course introduces formal logic and its applications. It also develops relational thinking through the study of sets, relations, functions, and graphs. The concept of recursion and its applications is also covered. It also develops quantitative thinking through the study of permutations, combinations, and counting operations in algorithms. Finally, this course shows how these concepts can be applied towards analyzing the accuracy and efficiency of algorithms.