Skip to main content Skip to navigation

CS147 Discrete Mathematics and Its Applications 2

CS147-10 Discrete Mathematics and Its Applications 2

Academic year
22/23
Department
Computer Science
Level
Undergraduate Level 1
Module leader
Sayan Bhattacharya
Credit value
10
Module duration
10 weeks
Assessment
Multiple
Study location
University of Warwick main campus, Coventry
Introductory description

This module is designed to introduce students to language and methods of the area of Discrete Mathematics.

Module aims

The focus of the module is on basic mathematical concepts in discrete maths and on applications of discrete mathematics in algorithms and data structures. One of the aims will be to show students how discrete mathematics can be used in modem computer science (with the focus on algorithmic applications).

Outline syllabus

This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.

Big-Oh notation and its use in the analysis of algorithms.
Basic concepts from graph theory; such as trees, matchings, euler tours, colorings and cuts.
Applications of discrete probability; such as probabilistic method, random walks and entropy.

Learning outcomes

By the end of the module, students should be able to:

  • Understand the notion of mathematical thinking, mathematical proofs, and algorithmic thinking, and be able to apply them in problem solving.
  • Understand asymptotic notation, its significance, and be able to use it to analyse the runtimes of algorithms.
  • Understand some basic properties of graphs and discrete probability, and be able to apply the methods from these subjects in problem solving.
Indicative reading list

To be finalised.

Subject specific skills

Basic knowledge of graph theory and its applications in algorithms
Basic knowledge of discrete probability and its applications in algorithms
Understanding and using asymptotic notations in design and analysis of algorithms

Transferable skills

Communication - Reading and writing mathematical proofs
Critical thinking - problem solving

Study time

Type Required
Lectures 30 sessions of 1 hour (30%)
Seminars 9 sessions of 1 hour (9%)
Private study 31 hours (31%)
Assessment 30 hours (30%)
Total 100 hours
Private study description

Revision of lectures
Going through the problems solved during seminar sessions
Solving past exam papers

Costs

No further costs have been identified for this module.

You do not need to pass all assessment components to pass the module.

Assessment group D
Weighting Study time
Coursework 20% 10 hours

Homework exercise consisting of several problems.

CS137 exam (Summer) 80% 20 hours

CS137 final exam (Summer)


  • Answerbook Pink (12 page)
Assessment group R
Weighting Study time
CS137 resit exam (September) 100%
  • Answerbook Pink (12 page)
Feedback on assessment

Marked scripts available on students' request

Past exam papers for CS147

There is currently no information about the courses for which this module is core or optional.

Further Information

Term 2

10 CATS (5 ECTS)

Online Material

Additional Information

Module Organisers:
Ramanujan Sridharan
Sayan Bhattacharya