
Description:  Main topics include introduction to the ideas of discrete mathematics, combinatorial problems, and proof techniques including mathematical induction, sets, graphs, trees, recursion, and enumeration. 
Credit Hours.:  3 
Text Book:  Susanna S. Epp, Discrete Mathematics with Applications, Third Edition, 2004 
Coordinator:  Mohammad Hayajneh 
Topics Outline:   Rules of the game, Logic
 Predicates and quantifiers, Proof techniques
 Sets and Set operations
 Functions
 Integers and division
 Matrices
 Proof strategy
 Sequences and summations
 Mathematical induction i/c loop invariants
 Recursive definitions and structural induction
 Relations
 Graphs

Outcomes:   Use formal methods of symbolic propositional and predicate logic.
 Use basic proof techniques.
 Relate mathematical induction to recursion and recursively defined structures.
 Illustrate basic terminologies of graph theory.
 Perform operations associated with sets, functions, matrices and relations.

Mapping of Topics Outline to Outcomes   1 
2 
3 
4 
5 
6 
7 
8 
9 
10 
11 
12 
1 
           
2 
           
3 
           
4 
           
5 
           

Prerequisite  MATH105: Calculus I
