Source paper: people.maths.ox.ac.uk/suli/MMSC_2020.pdf

This is the B1 paper for the MSc in mathematical modelling and scientific computing course of the University of Oxford. Questions 1–2 have original solutions below. The official revision page identifies public model solutions to questions 3–4, so those questions are skipped. The programme also advertises a student-only past-papers-and-solutions folder; its exact coverage of this paper has not been established.

Solutions to all six questions of the 6 December 2018 Statistics Core examination. Oxford examination release ZIP, member Digital Social Research Statistics Core/2018 Michaelmas a14564w1.pdf. The cover heading prints A14564W1, while alternating footers print A14653W1; both are retained as markings on one paper. All nine figures and the unnumbered output for Question 1 are available. Several supplied numerical fields contradict one another. Each solution distinguishes what the printed fields would mean if trusted from calculations supported by the displayed counts or compatible summary fields; no individual dataset or unique correction is invented.

Source paper: released examination archive, member 2017/T/a15684w1.pdf. The printed cover dates this examination to 29 May 2018. All three questions and all eighteen lettered parts are answered below. The stag-hunt arguments distinguish the intended positive rewards from the zero-reward boundary omitted in the printed assumptions.

Solutions to all three questions of the University of Oxford computer science finals paper, Trinity Term 2018, held on 16 June 2018. Every printed option is treated.

Source: Public examination-paper archive, member 2017/T/a16156w1.pdf, paper A16156W1, three scanned pages. The printed 2018 cover controls the sitting despite the archive member’s directory name.

Solutions to the paper dated 1 June 2015.^[ref] Every numbered subpart is treated. The original assertions in 2(b) and 2(c) are false: the two-bin repeated singleton-removal allocation gives exact counterexamples. Those answers explain the defect and the intended conditional calculation; 2(d) also supplies an independent, valid bound for the actual process.

Solutions to all three questions of the paper dated 11 June 2015.^[ref] In the equations below, $r_m$ and ${▹}_m$ denote the base computational monad's result and sequencing operations. All equalities of computations are extensional: apply both sides to the same remaining arguments. Haskell fragments use result and bind for the paper's $\mathrm{result}$ and $▹$. The FunMem programs use the language's own syntax.

The solutions use the original seven-page paper, including its corrected Question 3.^[ref]