Design and Analysis of Algorithms

This page collects 103 design and analysis of algorithms questions taken from 4 BEU semester 5 papers, 2022 to 2025 — about 26 questions in a typical paper. They are sorted into the 5 modules of the syllabus, so you can revise a topic across every year at once instead of working through papers one at a time. 98 of them have a worked solution.

What these papers actually ask

Module 3: Graph and Tree Algorithms is the heaviest module in this archive at 29% of every question recorded, and it has come up in all 4 papers. Together with Module 1: Introduction, the two account for 54% of the archive.

4 modules have appeared in all 4 papers — Module 3: Graph and Tree Algorithms, Module 1: Introduction, Module 2: Fundamental Algorithmic Strategies, Module 4: Tractable and Intractable Problems. A module that turns up every year is a safer use of revision time than one with the same question count concentrated in a single paper.

How the marks are split

Questions in this archive carry 7 different mark values. The most common is the 7-mark question, with 56 of them recorded — worth knowing before you decide how much depth to practise at.