Module and Programme Catalogue

Search site

Find information on

2018/19 Undergraduate Module Catalogue

COMP1511 Introduction to Discrete Mathematics

10 creditsClass Size: 300

Module manager: Kristina Vuskovic
Email: k.vuskovic@leeds.ac.uk

Taught: Semester 2 View Timetable

Year running 2018/19

This module is not approved as a discovery module

Module summary

Discrete mathematics studies finite mathematical structures and is the mathematical foundation for many Computer Science disciplines including algorithm design, data structures, database theory, formal languages and automata, compilers and importantly security. This module concentrates on the fundamentals of discrete mathematics introducing a number of concepts and skills that will be applied throughout the remainder of the Computer Science curriculum.This module builds upon previously taught mathematics modules and introduces students to a variety of powerful tools that can model a wide range of problems that arise in many areas including transportation, telecommunications and molecular biology.

Objectives

To develop the range of concepts and techniques that students have when approaching real world problems and to allow students the opportunity to apply problem solving techniques to problems that arise in Computer Science disciplines. 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 counting arguments to problems that arise in Computer Science and more widely.
- recall definitions and theorems from the topic areas of combinatorics, discrete probability and graph theory.
- construct mathematical arguments, in the effort to prove the correctness of theorems.
- deploy problem solving techniques to problems within the discipline.
- transfer problem solving skills into difference domains.


Syllabus

This module covers the following 3 topic areas:

- Combinatorics : multiplication principle, addition principle, Pigeon hole principle, permutation and combinations (with and without repetition).
- Discrete probability : experiment, sample space, events, finite probability space, equi-probable spaces, conditional probability, mutually exclusive and independent events.
- Graph theory : graph models, graph isomorphism, degree, paths, cycles, Euler's theorem, bipartite graphs and trees.

Teaching methods

Delivery typeNumberLength hoursStudent hours
Class tests, exams and assessment12.002.00
Lecture221.0022.00
Tutorial101.0010.00
Private study hours66.00
Total Contact hours34.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 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.


Exams
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

Disclaimer

Browse Other Catalogues

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

© Copyright Leeds 2019