Computer Science is not only programming. University Computer Science quickly uses mathematical ideas that may be only lightly developed in school: logic, sets, functions, combinatorics, proof, graphs, probability, linear algebra and asymptotic reasoning.
The most valuable pre-university bridge: discrete Mathematics
- Propositional logic and quantifiers
- Sets, relations and functions
- Direct proof, contradiction and induction
- Counting and combinatorics
- Graph theory
- Recurrence relations
- Modular arithmetic
- Probability
Why proof matters in Computer Science
Algorithms are not trusted because they appear to work on examples. Computer Science asks whether an algorithm is correct, whether it terminates and how its resource use grows. Those are mathematical questions.
Calculus and linear algebra still matter
Calculus becomes important in machine learning, optimisation, graphics and scientific computing. Linear algebra is central to data science, machine learning, graphics, numerical computing and many AI systems. A student interested in CS should not assume discrete Mathematics replaces continuous Mathematics.
Singapore admissions context
NUS and NTU Computing-related programmes use Mathematics among their subject prerequisites, although the exact acceptable subjects differ by programme. SMU Computer Science also publishes a Mathematics/Physics prerequisite route. Always use the current programme page rather than a generic “CS requires H2 Math” rule.
A six-week pre-CS Mathematics bridge
- Logic and sets
- Functions and relations
- Proof and induction
- Counting and probability
- Graphs and recurrence
- Vectors, matrices and basic linear algebra
For deeper number-theoretic and algorithmic routes, BTT also has a Computational Number Theory library.
World Mathematics route: return to the World Mathematics Atlas for the wider school → examination → admissions → university Mathematics map.
Mathematics for Computer Science applicants: build the discrete-thinking bridge before Year 1
Computer science uses more than school calculus
Many university CS programmes rely on discrete mathematics, logic, sets, functions, combinatorics, probability and linear algebra alongside calculus. Exact prerequisites vary by institution, so this page should prepare mathematical thinking rather than claim one universal admissions syllabus.
Logic becomes executable reasoning
Propositions, implication, negation, quantifiers and proof methods support algorithms and correctness arguments. Students should practise translating ordinary statements into precise logical structure.
Sets and functions become foundational language
Relations, mappings, injectivity, surjectivity and composition appear throughout theoretical computer science. School function knowledge can be extended beyond graphing.
Counting supports complexity and probability
Permutations, combinations, pigeonhole reasoning and recurrence help analyse possibilities and algorithmic states.
Proof by induction matters
Induction proves statements about recursively defined or indexed structures. Strong induction and invariants are useful extensions.
Graph theory models networks
Vertices and edges represent connections. Paths, trees, cycles and connectivity lead naturally into data structures, networks and algorithms.
Recurrence relations model recursive algorithms
Students can learn to generate terms, solve simple recurrences and interpret growth before formal algorithm analysis.
Probability supports randomised systems and data
Conditional probability, expectation and distributions provide useful preparation for machine learning, algorithms and systems.
Linear algebra becomes increasingly important
Vectors, matrices and transformations underpin graphics, optimisation, machine learning and scientific computing.
Programming can reinforce Mathematics
A short program can enumerate cases or test conjectures, but computational evidence is not proof. Use code to explore, then explain the mathematics.
Admissions are programme-specific
Check the exact university’s current Mathematics prerequisites, accepted qualifications and required grades. This guide should not substitute for official admissions information.
Pre-university route
Strengthen algebra and functions, learn basic proof/discrete Mathematics, add matrices and probability, then use small programming experiments to connect the ideas.