Skip to main content
Module Search
A street in Durham, with old buildings and people walking down the street
 

COMP4197: RANDOMISED ALGORITHMS AND PROBABILISTIC METHODS

Please ensure you check the module availability box for each module outline, as not all modules will run in each academic year. Each module description relates to the year indicated in the module availability box, and this may change from year to year, due to, for example: changing staff expertise, disciplinary developments, the requirements of external bodies and partners, and student feedback. Current modules are subject to change in light of the ongoing disruption caused by Covid-19.

Type Open
Level 4
Credits 10
Availability Available in 2023/24
Module Cap None.
Location Durham
Department Computer Science

Prerequisites

  • COMP2181 Theory of Computation

Corequisites

  • None

Excluded Combinations of Modules

  • None

Aims

  • The aim of the module is to equip students with the ability to design and analyse efficient probabilistic algorithms.

Content

  • To be chosen from the following:
  • basic bounds and inequalities (Markov, Chebyshev, Chernoff)
  • Martingales
  • Markov chains and random walks
  • the probabilistic method
  • approximate counting
  • parallel and distributed probabilistic algorithms

Learning Outcomes

Subject-specific Knowledge:

  • On completion of the module, students will be able to demonstrate:
  • a knowledge about various important problem solving paradigms in the broad area of probabilistic methods and algorithms
  • an ability to apply techniques and methods from the relevant topics to tackle fundamental algorithmic problems
  • an ability to conduct review and self-study to further their knowledge beyond the taught material

Subject-specific Skills:

  • On completion of the module, students will be able to demonstrate:
  • an ability to apply methods and techniques from various areas of algorithmic design and probability theory
  • an ability to reason with and apply methods of mathematical proof

Key Skills:

  • On completion of the module, students will be able to demonstrate:
  • an ability to think critically
  • an ability to work with abstract problems
  • an ability to undertake general problem solving

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

  • Lectures enable the students to learn new material relevant to the design of probabilistic algorithms, as well as their applications.
  • Formative assessments assess the application of methods and techniques, and examinations in addition assess an understanding of core concepts.

Teaching Methods and Learning Hours

ActivityNumberFrequencyDurationTotalMonitored
lectures222 per week1 hour22 
preparation and reading78 
total100 

Summative Assessment

Component: ExaminationComponent Weighting: 100%
ElementLength / DurationElement WeightingResit Opportunity
Examination2 hours100No

Formative Assessment

Example formative exercises are given during the course. Additional revision lectures may be arranged in the module's lecture slots in the 3rd term.

More information

If you have a question about Durham's modular degree programmes, please visit our FAQ webpages, Help page or our glossary of terms. If you have a question about modular programmes that is not covered by the FAQ, or a query about the on-line Undergraduate Module Handbook, please contact us.

Prospective Students: If you have a query about a specific module or degree programme, please Ask Us.

Current Students: Please contact your department.