Design and Analysis of Algorithms (G6017)

15 credits, Level 5

Autumn teaching

On this module, you’ll explore the design of algorithms.

You’ll examine strategies for dealing with wide classes of algorithmic problems, such as:

  • divide and conquer
  • randomised algorithms
  • dynamic programming
  • greedy algorithms
  • network flow algorithms.

You’ll apply these strategies to write solutions to new problems of asymptotic complexity.

You’ll also explore when each strategy should be applied. For example, in polynomial time, you’ll learn:

  • dynamic programming is a useful tool for solving problems
  • a greedy algorithm is typically faster.

We regularly review our modules to incorporate student feedback, staff expertise, as well as the latest research and teaching methodology. We鈥檙e planning to run these modules in the academic year 2026/27. However, there may be changes to these modules in response to feedback, staff availability, student demand or updates to our curriculum.

We鈥檒l make sure to let you know of any material changes to modules at the earliest opportunity.

Courses

This module is offered on the following courses: