Discrete Mathematics
Course Code
II2110
Number of Credits
3
Semester
3
Course Type
C
Related Courses
| No | Code | Course | Relation |
|---|---|---|---|
| 1 | II2110 | IST Mathematic | Equivalent |
Study Material
| Study Material | Depth |
|---|---|
| Logic: propositional logic, applications of propositional logic, predicate, rules of inference, proof | Expert |
| Basic structures: set, function, sequence, matrix | Expert |
| Algorithms: growth of functions, complexity of algorithms | Expert |
| Number theory: modular arithmetic, applications of congruences, cryptography | Expert |
| Induction and recursion | Expert |
| Counting: permutations and combinations | Expert |
| Relations | Expert |
| Graphs: model, terminology, representation, connectivity, paths, shortest path problem, applications of graphs | Expert |
| Trees: types and applications of trees | Expert |
Graduate Learning Outcomes (GLO) carried by the course
| CPMK Code | Course Learning Outcomes Elements (CLO) |
|---|---|
| CPMK 1 | Identify mathematical notations, formulas, and statements to represent problems. |
| CPMK 2 | Apply discrete mathematics to solve a problem. |
Learning Method
- Lectures and problem-solving discussions
Learning Modality
- Synchronous visual
Assessment Methods
- Mid-term exam, final exam, and quizzes