IFFS2201 - Discrete Structure
Overview
This course provides a foundational introduction to discrete mathematics and formal logic, which form the theoretical backbone of computer science and information systems. It focuses on structures that are fundamentally discrete rather than continuous, equipping students with the mathematical rigor required for software engineering, data structures, and algorithm design.
Students will develop critical thinking skills by translating natural language into propositional and predicate logic, mastering methods of formal inference (such as Disjunctive Syllogism), and applying logical laws (e.g., the Absorption Law). The curriculum moves from set theory and relational databases to combinatorics, induction, and the foundational elements of graph theory and trees used in routing and network architectures.
Through logical proof construction and computational modeling, students will gain the ability to analyze complex systems, verify code correctness, and design mathematically sound, optimized technical solutions.
Learning Hours Composition:
- 42 hours face to face, consisting of 14 sessions of lecturing, tutorial or workshop.
- 28 hours of Structured Learning and Guided Group Discussions
- 65 hours of Independent, Project-Based Learning
Managing Faculty:
Credit Point:
3 Credit(s)
Learning Hours:
45 hours x 3 CPs = 135 hours
