Discrete Mathematics (Math. 153)

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
المرفق الحجم
lecture_1.pptx 0 بايت
lecture_2.pptx 0 بايت
lecture_1.pdf 0 بايت
lecture_2.pdf 0 بايت
2.1_sets.pptx 0 بايت
2.2_set_operations.pptx 0 بايت
3.8_matrices.pptx 0 بايت
relations_1.pptx 0 بايت
8.5_equivalence_relations.pptx 0 بايت
8.3representing_relations.pptx 0 بايت
_boolean_algebra_1.pptx 0 بايت
_representing_boolean_functions.pptx 0 بايت
boolean_algebra_1.pptx 0 بايت
representing_boolean_functions.pptx 0 بايت
logic_gates.pptx 0 بايت
11.4_minimization_of_circuits.pptx 0 بايت
graphs.pptx 0 بايت
trees.pptx 0 بايت
h.w.pdf 0 بايت
h.w_matrix.pdf 0 بايت
h.w_sets.pdf 0 بايت