Math1111

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

  • Binary decimal, Octal and hexadecimal number systems
  • Algebraic operations on binary system
  • 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
  • Matrices
المرفق الحجم
introduction_to_number_systems 0 بايت
1-Lecture 0 بايت
2-Lecture 0 بايت
3-Lecture 0 بايت
4-Lecture 0 بايت
propositional logic 0 بايت
5-Lecture 0 بايت
Propositional Equivalences 0 بايت
6-Lecture 109.88 كيلوبايت
ِِArgument 2.8 ميغابايت
7-Lecture 449.03 كيلوبايت
Sets 602.32 كيلوبايت