Design & Analysis of Algorithms

This page collects 100 design & analysis of algorithms questions taken from 4 BEU semester 4 papers, 2019 to 2024 — about 25 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. 1 of them has a worked solution.

What these papers actually ask

Module 3: Greedy, Dynamic Programming and Other Paradigms 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 and Complexity Analysis, the two account for 52% of the archive.

Every module has appeared in all 4 papers, so this subject spreads its questions across the whole syllabus rather than favouring a few topics.

How the marks are split

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