Skip to main content Skip to navigation

CS136 - Discrete Mathematics & its Applications 1

  • Module code: CS136
  • Module name: Discrete Mathematics & its Applications 1
  • Department: Computer Science
  • Credit: 12

Content and teaching | Assessment | Availability

Module content and teaching

Principal aims

To introduce students to language and methods of the area of Discrete Mathematics. The focus of the module is on basic mathematical concepts in discrete mathematics and on applications of discrete mathematics in algortihms and data structures. To show students how discrete mathematics can be used in modern computer science (with the focus on algorithmic applications).

Principal learning outcomes

On completion of the module the student should be able to understand:The fundamental concepts of discrete mathematics.The role of formal definitions, formal and informal mathematical proofs, and underlying algorithmic thinking, and be able to apply them in problem solving.The role of discrete mathematics in applications in computer science.

Timetabled teaching activities

Term 1. 30 one-hour lectures and 9 seminars

Departmental link

Module assessment

Assessment group Assessment name Percentage
12 CATS (Module code: CS136-12)
D (Assessed/examined work) Assessed Course Work 20%
Examination - Main Summer Exam Period (weeks 4-9) 80%

Module availability

This module is available on the following courses:

  • Undergraduate Discrete Mathematics (G4G1) - Year 1
  • Undergraduate Discrete Mathematics (G4G3) - Year 1
Optional Core