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
Attachment Size
introduction_to_number_systems 0 bytes
1-Lecture 0 bytes
2-Lecture 0 bytes
3-Lecture 0 bytes
4-Lecture 0 bytes
propositional logic 0 bytes
5-Lecture 0 bytes
Propositional Equivalences 0 bytes
6-Lecture 109.88 KB
ِِArgument 2.8 MB
7-Lecture 449.03 KB
Sets 602.32 KB
8-Lecture 539.57 KB
ٍSet Operation 195.96 KB
9-Lecture 712.58 KB
Relation 3.01 MB
10-Lecture 426.2 KB
representing relations 1.55 MB
11-Lecture 328.99 KB
equivalence relations 3.75 MB
12-Lecture 853.66 KB
Boolean algebra 288.78 KB
13-Lecture 505.29 KB
Representing Boolean Functions 138.24 KB
14-Lecture 442.79 KB
Logic Gates 269.25 KB
15-Lecture 726.27 KB
Minimization of Circuits 693.03 KB
16-Lecture 447.66 KB
Graph 1 217.34 KB
17-Lecture 630.15 KB
Graph 2 326.49 KB
18-Lecture 277.22 KB
Connectivity 464.34 KB
19-Lecture 688.93 KB
Trees 598.42 KB
20-Lecture 502.65 KB
Matrices 166.89 KB