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 | 632.81 KB |
| 1-Lecture | 459.09 KB |
| 2-Lecture | 424.95 KB |
| 3-Lecture | 219.56 KB |
| 4-Lecture | 654.62 KB |
| propositional logic | 501.71 KB |
| 5-Lecture | 409.08 KB |
| Propositional Equivalences | 724.41 KB |
| 6-Lecture | 448.13 KB |
| Sets | 602.32 KB |
| 7-Lecture | 849.57 KB |
| ٍSet Operation | 195.96 KB |
| 8-Lecture | 853.66 KB |
| Boolean algebra | 288.78 KB |
| 9-Lecture | 505.29 KB |
| Representing Boolean Functions | 138.24 KB |
| 10-Lecture | 442.79 KB |
| Logic Gates | 269.25 KB |
| 11-Lecture | 726.27 KB |
| Minimization of Circuits | 693.03 KB |
| 12-Lecture | 447.66 KB |
| Graph 1 | 217.34 KB |
| 13-Lecture | 630.15 KB |
| Graph 2 | 326.49 KB |
| 14-Lecture | 277.22 KB |
| Connectivity | 464.34 KB |
| 15-Lecture | 688.93 KB |
| Trees | 598.42 KB |
Course Materials