2017/18 Undergraduate Module Catalogue

COMP1421 Fundamental Mathematical Concepts

10 creditsClass Size: 200

Module manager: Dr Isolde Adler
Email: l.m.adler@leeds.ac.uk

Taught: Semester 1 (Sep to Jan) View Timetable

Year running 2017/18

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.

Objectives

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.

Syllabus

This module covers the following 5 topic areas:

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

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

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

- Relations & Functions : relations of sets, inverse relations, 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 type	Number	Length hours	Student hours
Example Class	11	1.00	11.00
Class tests, exams and assessment	1	2.00	2.00
Lecture	22	1.00	22.00
Tutorial	10	1.00	10.00
Private study hours			55.00
Total Contact hours			45.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

Coursework

Assessment type	Notes	% of formal assessment
Problem Sheet	Problem Sheet	5.00
Problem Sheet	Problem Sheet	5.00
Problem Sheet	Problem Sheet	5.00
Problem Sheet	Problem Sheet	5.00
Total percentage (Assessment Coursework)		20.00

This module is re-assessed by exam only.

Exams

Exam type	Exam duration	% of formal assessment
Standard exam (closed essays, MCQs etc)	2 hr 00 mins	80.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: 26/04/2017

Disclaimer

Browse Other Catalogues

• Undergraduate module catalogue
• Taught Postgraduate module catalogue
• Undergraduate programme catalogue
• Taught Postgraduate programme catalogue

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