Some important mathematical concepts used by computer scientists are introduced in this module. More sophisticated than earlier modules, the applications can be found in cryptography, security, computer graphics, hardware and operating systems design
MODULAR ARITHMETIC
Congruence. Positive and negative integers modulo m. Mod arithmetic. Prime numbers. Greatest common denominator. The Euclidean Algorithm. Solving linear congruence equations. Modular encodings/decodings. Mod arithmetic, congruences, and encoding in programming. A simple random number generator and implementation in code.
MATRIX METHODS
Matrix formulation of linear equations. Determinants. Inverse of 2x2 and 3x3 matrices. Row Operations. Gaussian elimination.
NUMERICAL METHODS
Iterative methods – Bisection Method and Newton’s Method (Using an appropriate programming language for both methods). Numerical integration – the Trapezoid Method and Monte Carlo Methods. Interpolation.
| Module Content & Assessment | |
|---|---|
| Assessment Breakdown | % |
| Other Assessment(s) | 30 |
| Formal Examination | 70 |