Key information
- Faculty
- Faculty of Mathematical and Physical Sciences
- Teaching department
- Mathematics
- Credit value
- 15
- Restrictions
-
This module is normally taken by third year students on single or combined Mathematics degrees who have previously taken MATH0014 Algebra 3.
- Timetable
-
Alternative credit options
There are no alternative credit options available for this module.
The course aims at an introduction to combinatorial algorithms and to the theory of efficiency of algorithms. One main topic is network flows and extremal problems on graphs, including minimum spanning trees, shortest paths, and maximum flows. Another main topic is the theory of combinatorial algorithms, including Turing machines and NP-completeness. Various examples will illustrate the difference between polynomial and exponential time algorithms.
Module deliveries for 2024/25 academic year
Intended teaching term:
Term 2 听听听
Undergraduate (FHEQ Level 6)
Teaching and assessment
- Mode of study
- In person
- Methods of assessment
-
90%
Exam
10%
Coursework
- Mark scheme
-
Numeric Marks
Other information
- Number of students on module in previous year
-
127
- Module leader
-
Dr Alexey Pokrovskiy
- Who to contact for more information
- math.ugteaching@ucl.ac.uk
Last updated
This module description was last updated on 19th August 2024.
听
Close
