Math. 151 - Math. 153 - Math. 1111
The aim of this course is to introduce some mathematical methods for computer sciences. It gives a theoretical understanding of the following: 1

• Methods of proof: Direct
  Proof
   
• Indirect Proof (Contradiction)-Contrapositive Proof-By
  Induction
   
• Proposition calculus and connectives
• Truth tabeles
• Tautologies and contradictions
• Logical equivalence
• Arguments
• Basic set operations
• Representing relations
• Boolean Algebra
• Boolean expressions
• Sum of product form
• Complete sum of product (CPS) of Boolean expression
• Karnaugh maps
• Maximal basic rectangles
• NOT, AND, OR gates
• Simplification of Logic Circuits
• Basic concepts of graph theory
• Trees