Discrete Mathematics for Computing
Mathematical reasoning for computing
About the Module
Discrete mathematics provides the mathematical language and reasoning used to describe and model how computer systems operate.
This module introduces key concepts in number theory, logic, combinatorics, sets, relations, functions and graphs. These form an important foundation for understanding computational problems and the principles underlying computing.
Through these topics, learners will develop their ability to reason logically, construct mathematical arguments and apply discrete mathematical concepts to computing.
What You Will Learn
By the end of this module, you should be able to:
- Identify which integers are congruent modulo a positive integer.
- Formulate, interpret and manipulate logical statements.
- Prove simple statements about computer programs using various proof techniques.
- Apply basic tools for counting.
- Manipulate relations and functions between sets.
- Understand different types of graphs.
Module Content
The module covers five topics in discrete mathematics.
Propositional and Predicate Logic
Propositions, logical operators, equivalent statements, De Morgan's laws, logical equivalence laws, order of operations, arguments and inference rules. Predicates, quantification and negating quantifiers.
Proof Techniques
Direct proof, proof by induction, proof by contradiction and proof by contrapositive.
Combinatorics
Principles of counting, combinations and permutations.
Sets, Relations and Functions
Sets, operations on sets, cardinality, power sets and Cartesian products. Relations, relations on a set and equivalence relations. Functions, injectivity, surjectivity, bijectivity, inverses and composition.
Graphs
Graphs, vertices, edges, directed graphs, weighted graphs, Hamiltonian graphs and complete graphs.
Upcoming Intake
March – June 2027
Registration deadlines vary by module. Review the consultation and assessment schedules before registering for your modules.
Discrete Mathematics for Computing
Register by
13 Mar 2027
Online consultations
13 Apr – 18 May 2027
Tuesdays, 6.30 – 8.30pm
On-site assessment
22 May 2027
10.00 – 11.00am
Other Bridging Modules
Linear Algebra and Calculus for Computing
Register by
21 Feb 2027
Online consultations
4 Mar – 8 Apr 2027
Thursdays, 6.30 – 8.30pm
On-site assessment
10 Apr 2027
1.00 – 2.00pm
Introduction to Computational Thinking and Programming
Register by
21 Feb 2027
Online consultations
2 Mar – 6 Apr 2027
Tuesdays, 6.30 – 8.30pm
On-site assessment
10 Apr 2027
10.00 – 11.00am
Probability and Statistics for Computing
Register by
13 Mar 2027
Online consultations
15 Apr – 19 May 2027
Thursdays, 6.30 – 8.30pm
On-site assessment
22 May 2027
1.00 – 2.00pm
Introduction to Computer Systems
Register by
25 Apr 2027
Online consultations
25 May – 24 Jun 2027
Tuesdays*, 6.30 – 8.30pm
*CT1002 includes an additional Thursday consultation in week 5.
On-site assessment
26 Jun 2027
10.00 – 11.00am
Accessing Your Online Learning Materials
Once enrolled, you can access your module's online learning materials through NTULearn.
Please refer to your enrolment instructions for details on accessing your course materials.
Fees and Funding
Each Bridging Module costs S$250, bringing the total fee for all five modules to S$1,250.
Eligible learners may use their SkillsFuture Credit towards the module fees.
For more information on eligibility and usage, visit the MySkillsFuture portal.
If you need to retake a module you have not passed, the standard module fee will apply to each retake.
Registration and Technical Support
Before you register
You will need to create a learner account in NTU's Training Management System (TMS) using your personal email address before registering for a Bridging Module.
For guidance on account creation and registration, refer to the Learner User Guide.
50 Nanyang Avenue, Singapore 639798