COMP0147 Discrete Mathematics for Computer Scientists

This database contains the 2018-19 versions of syllabuses.

Note: Whilst every effort is made to keep the syllabus and assessment records correct, the precise details must be checked with the lecturer(s).

Academic session

2018-19

Module

Discrete Mathematics for Computer Scientists

Code

COMP0147

Module delivery

1819/A4U/T2/COMP0147 Undergraduate

Related deliveries

None

Prior deliveries

None - new delivery for 1819

Level

Undergraduate

FHEQ Level

L4

FHEQ credits

15

Term/s

Term 2

Module leader

Brotherston, James

Contributors

Brotherston, James

Kanovich, Max

Module administrator

Ball, Louisa

Aims

To equip first year computer science students with knowledge of foundational mathematics and logic that will be needed for future computer science modules. To provide students with basic tools and skills for mathematical problem solving, proof and refutation.

Learning outcomes

On successful completion of the module, a student will be able to:

  1. analyse and solve typical problems in discrete mathematics and logic;
  2. identify and reason with the logical content of arguments;
  3. carry out standard mathematical proofs and refutations.

Availability and prerequisites

This module delivery is available for selection on the below-listed programmes. The relevant programme structure will specify whether the module is core, optional, or elective.

In order to be eligible to select this module as optional or elective, where available, students must meet all prerequisite conditions to the satisfaction of the module leader. Places for students taking the module as optional or elective are limited and will be allocated according to the department’s module selection policy.

Programmes on which available:

  • BSc Computer Science (Year 1)
  • MEng Computer Science (Year 1)

Prerequisites:

To be eligible to select this module:

  • students must have passed A-level Mathematics (or an appropriate equivalent)

Content

The first 5 weeks of the course will focus on foundational discrete mathematics, including but not necessarily limited to: functions and relations, set theory, linear algebra and combinatorics. The second 5 weeks of the course will focus on mathematical logic, including: propositional logic, first-order logic, proof by mathematical induction and modal logic.

An indicative reading list is available via http://readinglists.ucl.ac.uk/departments/comps_eng.html.

Delivery

The module is delivered through a combination of lectures, problem solving classes, and written / online coursework exercises.

Assessment

This module delivery is assessed as below:

#

Title

Weight (%)

Notes

1

Written Examination (2 hours)

90

 

2

Coursework

10

LSA resit will be via open book test.

In order to pass this module delivery, students must:

  • achieve an overall weighted module mark of at least 40%; and
  • achieve a mark of at least 30% in any components of assessment weighed ≥ 30% of the module.

Where a component comprises multiple assessments, the minimum mark applies to the overall component.