Skip to main content
KBS_Icon_questionmark link-ico

Discrete Mathematics

Key information

  • Module code:


  • Level:


  • Semester:


  • Credit value:


Module description


Elementary properties of Integers. Functions and their behaviour. Introduction to Recursion. Algorithms and complexity. Graphs including Euler’s Theorem, shortest path algorithm and vertex colouring. Trees - applications include problem solving and spanning trees. Directed Graphs including networks. Dynamic programming. Codes and Cyphers - with Hamming codes and RSA.


There are no formal prerequisites. Pre-knowledge is minimal - a little linear algebra helps. Any tools needed will be presented in the course.

Assessment details

Written examination or alternative assessment. Details to be confirmed.

Educational aims & objectives

To give students an understanding of the nature of an algorithmic solution to problems, to illustrate the idea by applications to problems in discrete mathematics and to promote an algorithmic viewpoint in subsequent mathematical work.

Teaching pattern

Three hours of lectures and one hour of tutorial per week throughout the term

Suggested reading list

Suggested reading/resources (link to My Reading Lists)

Module description disclaimer

King’s College London reviews the modules offered on a regular basis to provide up-to-date, innovative and relevant programmes of study. Therefore, modules offered may change. We suggest you keep an eye on the course finder on our website for updates.

Please note that modules with a practical component will be capped due to educational requirements, which may mean that we cannot guarantee a place to all students who elect to study this module.

Please note that the module descriptions above are related to the current academic year and are subject to change.