61141 Discrete Mathematics

Course Description

Logic: Propositions (Statements), Logical connectives (not, or, and), Translation to and from Symbolic Notations, Statement Forms and their Truth Tables, Logical Equivalence, De Morgan’s Low, Tautologies, Contradictions, Conditional Statements (Contra positive, Converse, and Inverse), Bi-conditional Statements, Arguments, Argument Forms and validity.
Sequence and Series: Arithmetic Sequence, Arithmetic Series, Geometric Sequence, Geometric Series, Infinite Geometric Series.
Mathematical Induction: Principle of Mathematical Induction, Sum of the first n integers.
Set Theory: Description of Sets, Subsets, Empty Sets, Power Sets, Operation on Sets ( Union, Intersection, and Complement ).
Functions: Definition of a Function, One to One and Onto, Inverse Functions.
Relations: Definition and Notation for Relations, Inverse of a Relation, Reflexivity, Symmetry, Transitivity

Learning Objective

  • An important goal of the Discrete Mathematics is to develop student’s ability to think abstractly, this requires that students learn to use logically valid forms of argument. Students will get fundamental concepts about sets, relations, functions, and mathematical induction and they will use their applications in Computer Science.



Books for this Course

  • 1. Discrete Mathematics with Applications / Second edition Susanna S. Epp.
  • 2. Advanced Mathematics (Copy).

Times Offered

  • September 2014
  • January 2015

Course Prerequisite