Module and Programme Catalogue

Search site

Find information on

2018/19 Undergraduate Module Catalogue

COMP1421 Fundamental Mathematical Concepts

10 creditsClass Size: 300

Module manager: Dr Isolde Adler

Taught: Semester 1 View Timetable

Year running 2018/19

This module is not approved as a discovery module

Module summary

Computer Science, at its foundation, is a mathematical and engineering discipline. This module focuses on the mathematical concepts that are fundamental to the study of Computer Science. In order to fully understand the concepts of algorithms design, logical reasoning and programming it is necessary to understand how to apply mathematical arguments and how to apply mathematical knowledge to model real world problems.This module forms the vital core of the Computer Science curriculum and encourages students to view real world problems as mathematical problems and will prepare students for further mathematical study in Computer Science. The module will consider applications of the fundamental mathematical concepts into the contexts of verification and program correctness, systems security and complexity analysis.


To develop an appreciation and familiarity of mathematical concepts and their application in computer science in addition to equipping students with the appropriate problem solving techniques and transferable skills to tackle real world problems. To prepare students for further mathematical study in the discipline of Computer Science.

Learning outcomes
On successful completion of this module a student will have demonstrated the ability to:

- apply their mathematical knowledge to real world problems.
- identify appropriate mathematical tools to solve problems.
- construct mathematical arguments, in the effort to prove the correctness of theorems.
- deploy problem solving techniques to problems within the discipline.


This module covers the following 5 topic areas:

- Logic : propositions, connectives, truth tables, tautologies, contradictions, predicates and quantifiers.

- Proof techniques : direct proof, proof by contradiction, proof by contraposition and mathematical induction.

- Set theory : sets, set operations, Venn diagrams, set equality, subsets and cardinality.

- Relations & Functions : relations of sets, inverse functions, equivalence relations, order relations, domain and range, inverse functions, composition of functions and properties of functions.

- Vectors & Matrices : addition, multiplication, distributive and associativity, non-commutativity, identity matrix and inverse of square matrices.

Teaching methods

Delivery typeNumberLength hoursStudent hours
Example Class111.0011.00
Class tests, exams and assessment12.002.00
Private study hours55.00
Total Contact hours45.00
Total hours (100hr per 10 credits)100.00

Private study

Taught session preparation: 18 hours
Taught session follow-up: 18 hours
Self-directed study: 7 hours
Assessment activities: 23 hours

Opportunities for Formative Feedback

Attendance and formative assessment

Methods of assessment

Assessment typeNotes% of formal assessment
Problem SheetProblem Sheet5.00
Problem SheetProblem Sheet5.00
Problem SheetProblem Sheet5.00
Problem SheetProblem Sheet5.00
Total percentage (Assessment Coursework)20.00

This module is re-assessed by exam only.

Exam typeExam duration% of formal assessment
Standard exam (closed essays, MCQs etc)2 hr 00 mins80.00
Total percentage (Assessment Exams)80.00

This module is re-assessed by exam only.

Reading list

The reading list is available from the Library website

Last updated: 30/04/2018


Browse Other Catalogues

Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD

© Copyright Leeds 2019