Back to courses index

ITBP202: Discrete Mathematics

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:
  1. Rules of the game, Logic
  2. Predicates and quantifiers, Proof techniques
  3. Sets and Set operations
  4. Functions
  5. Integers and division
  6. Matrices
  7. Proof strategy
  8. Sequences and summations
  9. Mathematical induction i/c loop invariants
  10. Recursive definitions and structural induction
  11. Relations
  12. Graphs
Outcomes:
  1. Use formal methods of symbolic propositional and predicate logic.
  2. Use basic proof techniques.
  3. Relate mathematical induction to recursion and recursively defined structures.
  4. Illustrate basic terminologies of graph theory.
  5. 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       
Pre-requisiteMATH105: Calculus I
Volume of the Course that Contributes to CIT Students Outcomes(SOs)
Move the mouse over the Students Outcome number to view the Students Outcome text
a b c d e f g h i j k l m n
75% 0% 12% 0% 0% 0%0% 0% 0% 0% 0% 0% 12% 0%
Show Details