Source paper: released examination archive, member
2015-fpdaa.pdf. The printed cover dates this examination to 16 June 2015.The original cover identifies the examination as 9 September 2015.[ref]
Discrete mathematics, continuous mathematics, and probability resit examination by the University of Oxford (2015). Cover, formal code A10100W1, Long Vacation 2015
The original cover establishes the date as 19 June 2015. The solutions use the printed question numbering and the natural deduction rules supplied with this paper.[ref]
Digital systems, linear algebra, introduction to formal proof examination paper by the University of Oxford (2015). Cover and Figures 1–3, printed pages 1 and 7
Solutions to all eight questions of the 18 June 2014 paper. The Scala fragments use the paper's Scala 2 style. Unless stated otherwise, array dimensions and array indices meet the supplied preconditions, and size calculations fit
Int.[ref]Imperative Programming examination paper by the University of Oxford (2014). Cover and pp. 2–15, Questions 1–8
The solutions use the original 17 June 2014 preliminary examination, code
4208.[ref]Functional programming, design and analysis of algorithms examination paper by the University of Oxford (2014). original scan, pp. 2–8
Haskell definitions use separate question namespaces; names suffixed F or U distinguish alternative implementations. For Question 4, use import Prelude hiding (foldr, (++), concat, flip) when compiling the definitions together. Unless an infinite input is discussed explicitly, inputs are finite and total. Arithmetic operation counts do not include the growing bit costs of exact integers.[ref]Solutions to all nine questions of the examination dated 26 June 2014.[ref]
Discrete Mathematics, Continuous Mathematics and Probability examination paper by the University of Oxford (2014). Printed cover, paper 4223; questions on printed pp. 2–10
The original cover dates this paper to 20 June 2014. The solutions follow the printed numbering and use the supplied natural deduction rules, including double-negation elimination. In the proof tables, the context column lists the numbered assumptions still in force; temporary assumptions are explicitly discharged by the indicated rule.[ref]
Digital systems, linear algebra, introduction to formal proof examination paper by the University of Oxford (2014). Cover and Figures 1–3, printed pages 1 and 9
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]
Imperative Programming examination paper by the University of Oxford (2013). Cover and printed pp. 2–11, Questions 1–8
These solutions follow the original examination of 11 June 2013, code
4208.[ref]Functional programming, design and analysis of algorithms examination paper by the University of Oxford (2013). pp. 2–7, Questions 1–8
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]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. There are unlisted articles, also show them or only show them.