In the first semester of this module, we will cover the topics in discrete mathematics that provide an essential foundation for later studies in the department. This includes topics such as sets, functions, sequences and relations, propositional and predicate logic, boolean algebra, combinatorics, induction, recursion, proof strategies, and graph theory.

In the second semester of this module, we will cover the topics in continuous mathematics that provide an essential foundation for later studies in the department. This includes topics such as trigonometric, exponential and logarithmic functions, polynomials, limits and continuity, differential calculus of one and two variables, integration, series summation and power series, matrices, vector calculus and linear algebra.    

Formal examinations.

• Blackboard
• Unconfirmed practical marks when available
• Exam Papers, past 2 years (where applicable)

• introduce the fundamental mathematical concepts needed in the computer science degree.
• enhance the students' confidence in mathematics.
• stimulate the students' interest in mathematics for computing.

• Reason using combinatorial arguments.
• Identify and use relevant mathematical notations.
• Demonstrate how mathematical techniques can contribute to the analysis of problems within computer science.
• Apply concepts in mathematics and statistics to frame problems and reason about them.

Semester 1 includes topics such as:

• sets, functions, sequences and relations,
• proof strategies and logical syntax,
• graph theory,
• combinatorics,
• algebraic structures and order theory,
• induction and recursion.

Semester 2 includes topics such as:

• linear algebra
  • Vectors,
  • Matrices,
  • vector spaces,
  • linear operators,
  • eigenvectors and eigenvalues,
• calculus/analysis
  • convergence of sequences and functions,
  • limits, O-o-notations,
  • Continuity,
  • differentiation and integration in R and C,
  • partial differentiation
  • basics of ordinary differential equations.