This course will provide an introduction to Discrete Mathematics, as well as its applications. Topics include: mathematical induction, sets, functions, basic number theory, graphs, trees, Boolean algebra, permutations, combinations, analysis of algorithms, probability principles and Bayes' Theorem, and finite state automata and formal languages. The course will provide foundational knowledge necessary for computer science and computer engineering studies.

4.5 Credit Hours