Module Descriptors
MATHS AND ALGORITHMICS
MATH40197
Key Facts
Faculty of Computing, Engineering and Sciences
Level 4
15 credits
Contact
Leader: Akbar Sheikh Akbari
Hours of Study
Scheduled Learning and Teaching Activities: 36
Independent Study Hours: 114
Total Learning Hours: 150
Assessment
  • CLASS-TEST weighted at 50%
  • EXAMINATION - UNSEEN IN EXAMINATION CONDITIONS weighted at 50%
Module Details
Module Texts
Discrete Mathematics for Computer Scientists, J. Truss, 1998 - Addison Wesley; ISBN: 0201360616
Understanding Algorithms and Data Structures, David Brunskill, John Turner, 1996 - McGraw-Hill Education, Europe ; ISBN: 0077091418
Module Indicative Content
Further differentiation: Chain, Product and Quotient Rules and Partial Differentiation applied to polynomials and trig functions.
Probability - Bayes' Theorem. The Normal Distribution.
Introduction to Predicate Calculus - Quanitifiers and basic deduction.
2 and 3 Dimensional vectors - Arithmetic, magnitude and scalar product.
Complex numbers - basic arithmetic in rectangular and polar representations - Argand diagrams.
Algorithmics: Time and Storage complexity - Big O notion - Complexity classes.
Algorithm Paradigms: Divide and Conquer, Greedy Algorithms, Dynamic Programming.
Module Special Admissions Requirements
Prior study of CE61002-1 Mathematics and Statistics for Computing Students and CE00371-1 Introduction to Software Development, or equivalent.
Only available for student's enrolled on FCET joints programme.

Excluded combination CE62021-2 Mathematics and Algorithmics.
Module Resources
Students must possess a suitable calculator with trigonometric and logarithmic functions as well as basic statistical functions.
Module Additional Assessment Details
1. A suite of multiple choice tests - 50% total, learning outcomes 1 - 3.
2. An end examination - 90 minutes - 50% total, learning outcomes 1 - 3.
Module Learning Strategies
Two one hour lectures each week.
One two hour tutorial to reinforce and extend the topics introduced in the lectures.