Study information

# Discrete Mathematics for Computer Science - 2024 entry

MODULE TITLE CREDIT VALUE Discrete Mathematics for Computer Science 15 ECM1415 Diego Marmsoler (Coordinator)
DURATION: TERM 1 2 3
DURATION: WEEKS 11 0 0
 Number of Students Taking Module (anticipated) 220
DESCRIPTION - summary of the module content

Discrete mathematics is concerned with quantities which vary discretely, and because of that has an important role in Computer Science, in which discrete structures such as sets, graphs, lists, and trees play a fundamental role, and the underlying forms of reasoning are based on propositional and predicate logic rather than on calculus and mathematical analysis, with an emphasis on counting rather than measuring, e.g. enumerating permutations and combinations of objects satisfying specified conditions. This module will provide a thorough grounding in the fundamental structures and methods of discrete mathematics that are required for computer science.

AIMS - intentions of the module

The aim of this module is to provide you with the basic concepts and tools developed in discrete mathematics disciplines but needed for the study of computer science. As such, it forms an essential part of a rounded education of a computer scientist or computer expert whose work includes computer-based data manipulations.

INTENDED LEARNING OUTCOMES (ILOs) (see assessment section below for how ILOs will be assessed)

On successful completion of this module, you should be able to:

Module Specific Skills and Knowledge:
1 demonstrate a sound understanding of selected essential topics in discrete mathematics and their importance in computer science disciplines.
Discipline Specific Skills and Knowledge:
2 reveal sufficient knowledge of fundamental discrete mathematics concepts.
Personal and Key Transferable / Employment Skills and Knowledge:
3 show independent learning skills;
4 reason using abstract ideas, formulate and solve problems and communicate reasoning and solutions effectively in writing;
5 use learning resources appropriately.

SYLLABUS PLAN - summary of the structure and academic content of the module

number systems: natural numbers, integers, rationals, reals, complex numbers;

number representation: positional notation (decimal, binary, hexadecimal), twos complement, fixed-point, floating point;

computer arithmetic: addition and subtraction, multiplication and division

set theory and standard notation: Intersection, union, complement, power set, Cartesian product;

functions and relations;

methods of proof;

propositional and first-order logic;

sums of standard finite and infinite series;

counting principles: the addition principle, the multiplication principle, permutations, combinations; some counting problems;

graph theory: basic concepts, definitions and results. Trees, balanced trees.

LEARNING AND TEACHING
LEARNING ACTIVITIES AND TEACHING METHODS (given in hours of study time)
 Scheduled Learning & Teaching Activities Guided Independent Study Placement / Study Abroad 32 118 0
DETAILS OF LEARNING ACTIVITIES AND TEACHING METHODS
 Category Hours of study time Description Scheduled learning and teaching 22 Lectures Scheduled learning and teaching 10 Problem classes Guided independent study 20 Coursework Guided independent study 98 Independent study

ASSESSMENT
FORMATIVE ASSESSMENT - for feedback and development purposes; does not count towards module grade
Form of Assessment Size of Assessment (e.g. duration/length) ILOs Assessed Feedback Method
Problem sets   All Verbal and written

SUMMATIVE ASSESSMENT (% of credit)
 Coursework Written Exams Practical Exams 10 90 0
DETAILS OF SUMMATIVE ASSESSMENT
Form of Assessment % of Credit Size of Assessment (e.g. duration/length) ILOs Assessed Feedback Method
Written exam-closed book 90% 1 hour - January Exam  All Model answers supplied on request
Continuous assessment 10% Weekly quizes All Automatic feedback using ELE

DETAILS OF RE-ASSESSMENT (where required by referral or deferral)

Original Form of Assessment Form of Re-assessment ILOs Re-assessed Time Scale for Re-assessment
Written exam-closed book Written exam (100%) (1 hour) All Referral/Deferral period

RE-ASSESSMENT NOTES

Reassessment will be by written exam only.

Deferral – if you have been deferred for any assessment you will be expected to submit the relevant assessment. The mark given for a re-assessment taken as a result of deferral will not be capped and will be treated as it would be if it were your first attempt at the assessment.

Referral – if you have failed the module overall (i.e. a final overall module mark of less than 50%) you will be expected to submit the relevant assessment. The mark given for a re-assessment taken as a result of referral will be capped at 40%

RESOURCES
INDICATIVE LEARNING RESOURCES - The following list is offered as an indication of the type & level of
information that you are expected to consult. Further guidance will be provided by the Module Convener

Kenneth H. Rosen Discrete Mathematics And Its Applications 8 Mc Graw Hill Education 2019 978-1-259-67651-2