DISCRETE MATHEMATICS (4 Credits)

Learning Outcomes:

On successful completion of this course, student will be able to: Explain fundamental concepts of mathematical logic and proof; Solve practical problems related to sets and counting; Explain the concept of function, relation and recursion; Apply the concept of graphs and trees in real problems; Explain some applications of discrete mathematics in computer science such as fuzzy set and finite automata.

Topics:

The logic of compound statements; The logic of compound statements; The logic of compound statements; The logic of quantified statements; Methods of proof; Methods of proof; Set theory; Set theory; Counting; Counting; Counting; Function, recursion, and fuzzy set; Function, recursion, and fuzzy set; Function, recursion, and fuzzy set; Relations; Relations; Relations; Relations; Graphs; Graphs; Graphs; Graphs; Graphs; Trees; Finite Automata; Finite Automata.