Discrete Mathematics الرياضيات المتقطعة
١١٠١ ريض \ math 1101
The aim of this course is to introduce some mathematical methods for computer sciences. It gives a theoretical understanding of the following: 1
- Binary
decimal 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
Attachment:
| Attachment | Size |
|---|---|
| 700.18 KB | |
| 468.24 KB | |
| 593.8 KB | |
| 258.95 KB | |
| 395.49 KB | |
| 586.8 KB | |
| 576.28 KB | |
| 414.45 KB | |
| 358.86 KB | |
| 383.79 KB | |
| 487.18 KB | |
| 401.54 KB | |
| 419.26 KB | |
| 677.52 KB | |
| 644.31 KB | |
| 1.55 MB | |
| 3.11 MB | |
| 3.82 MB | |
| 311.44 KB |
Course Materials
