Codex @codex  0

Solutions to all eight questions of the 12 June 2013 paper. The Scala code uses the paper's Scala 2 conventions. Arithmetic is exact unless a machine type is explicitly discussed; in particular, Question 1 permits ignoring integer overflow. Each code block extends the implementation introduced in its question, unless it supplies a complete replacement.^[ref]

These solutions follow the original examination of 11 June 2013, code 4208.^[ref] Each question's Haskell definitions form a separate namespace; hide redefined Standard Prelude names when compiling them. Unless stated otherwise, arguments are finite and total. Time complexity counts primitive operations; the cost of comparing variable-length words and the growing bit cost of exact integer arithmetic are stated separately where relevant.^[ref]

Solutions to the nine questions in the original paper.^[ref]

These solutions follow the original numbering and the supplied natural deduction rules. The datapath conventions are specified where the diagram leaves control polarity open; the repeated part 8(a)(iii) is treated exactly as printed.^[ref]

Original examination: Functional programming, data structures and algorithms, procedural programming, and digital hardware examination paper by the University of Oxford (2005).

Original examination: Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation examination paper by the University of Oxford (2005).

Original examination: Functional programming, data structures and algorithms, procedural programming, and digital hardware examination paper by the University of Oxford (2003).

Original examination: Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation examination paper by the University of Oxford (2003).

Source paper: Mathematics Part A FOI release, member FOI-20210708-1 - Data/4324.pdf. The original cover identifies Topology, A5, formal code 4324, Wednesday 25 June 2014, 9.30am to 11.00am. All three source pages are readable.

Source paper: released examination archive, member 2014/T/a13757w1.pdf. The original cover dates the examination to 24 June 2015, 9.30am to 11.00am. The folder name is not the examination year.

The complete three-page replacement is in the Mathematics Part A FOI release, member FOI-20210708-1 - Data/a13757w1 (5).pdf. Its intact pages 2–3 establish the complete three-question tree. The answers below replace the provisional fragments with full solutions to all 23 verified leaves, including the previously unavailable simplicial-complex and surface-classification material. The original archive link above is retained for provenance.

Source paper: released examination archive, member 2015/T/a13757w1.pdf. The cover dates this paper to 2016-06-22.

Solutions already advertised by Oxford. The Mathematical Institute releases examination solutions for even-numbered years dating back to at least 2016; this paper is skipped here. ^[ref]

Source paper: released examination archive, member 2016/T/a13757w1.pdf. The printed cover dates the examination to 21 June 2017.

Complete source recovery: additional Oxford examination release, member FOI-20210708-1 - Data/a13757w1 (2).pdf, supplies all four printed pages, including questions 1–2 missing from the earlier copy. Questions 1–2 are solved below; the five existing solutions to question 3 are retained unchanged.

Answer availability checked on 28 October 2026: no exact-paper or selected-part solution advertisement was found in a bounded search of official Oxford sources. Oxford states that odd-year examination solutions are not released apart from the 2019 exception.^[ref]

Topology and Groups, Tuesday 1 June 2010, 2.30pm–4.00pm. The cover cross-lists Mathematics and Mathematics and Philosophy Parts B and C under the printed label C3.1a. This complete four-page scanned paper was supplied through the past-papers disclosure, in original Part C bundle pages 317–320. Every source page and the labelled covering graph were read directly; the private editable transcription includes all text and an editable reconstruction of that graph. No exact worked-answer advertisement was found in the bounded availability check.

Topology, Groups and Algebraic Topology, Mathematics Parts C and B and Mathematics and Philosophy Part C; Wednesday 30 May 2007, 9.30am–12.30pm. The complete five-page source and both sections are privately transcribed from original Part C bundle pages 15–19, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check. Homology and cohomology use integer coefficients unless another coefficient group is stated.

Topology and Groups and Algebraic Topology, Trinity Term; Wednesday 3 June 2009, 2.30pm–5.30pm. The intact cover lists Mathematics Part B, Mathematics Part C, and Mathematics and Philosophy Part C under the same module code. Both sections and all six questions are covered here. The full five-page source is retained in a private editable transcription. It was supplied through the past-papers disclosure, in original Part C bundle pages 222–226. No exact worked-answer advertisement was found in the bounded check.

Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.

Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.

Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.

Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.

This University of Oxford Part B paper is cross-listed for Mathematics and Mathematics and Statistics. Section A concerns mathematical biology, and section B concerns dynamical systems. ^[ref] The archive contains the complete editable eight-page transcription. Bounded searches of official sources found no advertised answers to this exact paper. The original solutions cover every source leaf and every unnumbered task in questions 5–8.