Edexcel IAL · Mathematics · WDM11 · A Level

WDM11 Algorithms Topic Questions

Every WDM11 Algorithms topic question from the 2018–current syllabus, drawn from 16 papers (2019–2026) and grouped by syllabus point. Each row opens a page listing the exact question numbers, marks and a direct link into the paper. These are questions by topic, not full papers, so you can revise one topic at a time.

WDM11 5 subtopics 75 topic questions 16 papers 204 tagged marks

Back to Algorithms All paper codes

Core finding

1.2 Bin packing. is the most frequently assessed subtopic in Algorithms, with 33 topic questions and 84 marks across 16 papers. 1.3 Bubble sort. follows with 15 topic questions and 37 marks. The topic contains 5 subtopics, 75 topic questions and 204 marks in total. Rows count only the parts tagged to that subtopic, keep the same colour in both charts and repeat paper count, tagged marks and year range in the native table. Every row opens the matching past-paper question list, which links on to the exact paper and the practice entry point.

Topic question count and mark distribution

Subtopics are on the vertical axis and sorted from highest to lowest. Only the parts whose knowledge graph matches a subtopic are counted for it, and percentages are each row's share of the tagged total in that chart. A part tagged to several subtopics is counted in each bar, so the bars are not a partition of the topic total.

Questions by subtopic

question items

1.2 Bin packing. 16 papers

3344.0%

1.3 Bubble sort. 9 papers

1520.0%

1.4 Quick sort. 12 papers

1216.0%

1.1 The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text. 5 papers

912.0%

1.5 Binary search 5 papers

68.0%

Marks by subtopic

marks

1.2 Bin packing. 16 papers

8441.2%

1.4 Quick sort. 12 papers

4321.1%

1.3 Bubble sort. 9 papers

3718.1%

1.1 The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text. 5 papers

2210.8%

1.5 Binary search 5 papers

188.8%

Subtopic comparison matrix

Curriculum order is by syllabus number, then alphabetically. Every row links to the matching past-paper question list.

Subtopic	Topic questions	Papers	Marks	Years
1.1 The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text.	9	5	22	2021–2025	Open topic questions
1.2 Bin packing.	33	16	84	2019–2026	Open topic questions
1.3 Bubble sort.	15	9	37	2020–2026	Open topic questions
1.4 Quick sort.	12	12	43	2019–2026	Open topic questions
1.5 Binary search	6	5	18	2021–2026	Open topic questions

Browse every topic question

1.1 The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text. 9 question items · 5 papers 22 marks · 2021–2025 1.2 Bin packing. 33 question items · 16 papers 84 marks · 2019–2026 1.3 Bubble sort. 15 question items · 9 papers 37 marks · 2020–2026 1.4 Quick sort. 12 question items · 12 papers 43 marks · 2019–2026 1.5 Binary search 6 question items · 5 papers 18 marks · 2021–2026

Topic question rules and edge cases

How many subtopics does Algorithms contain?: This page lists 5 subtopics tagged to the current syllabus. They are ordered by syllabus number, then alphabetically, and each row opens a page of matching past-paper questions.
How are the subtopic question and mark totals calculated?: A multiple-choice question contributes one item and its marks to every subtopic it is tagged with. A structured question contributes one item per tagged part, and that part’s marks; untagged parts of the same question are not counted here. A part tagged to several subtopics therefore appears under each of them.
Why do some subtopics have no numbered prefix?: Practical-skills statements and some syllabus bullets are unnumbered. Numbered statements come first; unnumbered statements and ties are sorted alphabetically.
Is the LaTeX rendered without JavaScript?: Yes. Subtopics that contain formulas are converted to static KaTeX HTML during the build, and the KaTeX stylesheet is served from the same site.