Examination dated 5 June 2015, Trinity term, University of Oxford. The public archive contains the paper as the member 2015-adsa.pdf of Lawrence Attachment.zip. The three original pages contain the cover and thirteen numbered subparts on amortized analysis, flow networks, and linear programming.
The University of Oxford computer science finals examination dated Wednesday 3 June 2015, Trinity Term 2015. The four-page original has three questions, on computability theory, time complexity and logarithmic space. The public examination-paper archive supplied by the University of Oxford contains it as 2015-complex.pdf. Questions 2 and 3 are marked corrected. Question 3(e) uses the word path in a graph without specifying whether repeated vertices are permitted; the even-length directed reachability proof uses directed walks with length counted with multiplicity.
The six-page University of Oxford Finals paper, dated Saturday 6 June 2015, 9:30 am–11:00 am. The released Lawrence Attachment.zip contains it as 2015-arch.pdf. Printed pages 2–4 contain Question 1 and its two figures, page 5 Question 2 and its diagram, and page 6 Question 3.
The six-page University of Oxford Finals computer graphics paper dated Monday 8 June 2015. The released examination archive contains it as 2015-graphics.pdf. Questions occupy printed pp. 2–6. Question 2(b)(iii)'s two printed rotation products require an action-order qualification: their intended comparison works when the rotations are applied in written sequence, while ordinary column-vector products apply the rightmost factor first.
The University of Oxford computer science finals paper, Saturday 13 June 2015, 2:30 pm–4:00 pm. Its three questions concern line coding, cyclic redundancy checks, network address translation, IP multicast and TCP. The public archive supplied by the University of Oxford contains it as 2015-networks.pdf. Questions occupy printed pages 2–3.
The five-page University of Oxford Finals examination dated 1 June 2015, 2:30 pm–4:00 pm, Trinity Term 2015. The cover permits answers to two of three questions. Public released archive: Lawrence Attachment.zip, member 2015-concur.pdf. Printed p. 2 covers recursion, a reversal network and semantic indistinguishability; p. 3 covers a FIFO buffer and a modified CSP interrupt; pp. 4–5 concern termination detection on a ring network.
Primary source: Released examination archive, member 4224-1.pdf. The original nine-page scan identifies the University of Oxford Preliminary Examination in computer science on 14 June 2013. Questions 1–3 cover digital electronics, the datapath and file systems; Questions 4–6 cover linear algebra; Questions 7–8 use the supplied natural deduction rules on printed p. 9. The original p. 8 repeats Question 8(a)(i) as Question 8(a)(iii), and has a redundant closing parenthesis in Question 7(d)(i).
Examination paper of the University of Oxford, Preliminary Examination in Computer Science, Trinity Term 2015, dated 19 June 2015. The original has seven pages; the last contains the prescribed natural deduction rules. Released archive: Lawrence Attachment.zip, member 2015-cs4.pdf. The paper's printed section order is linear algebra, digital electronics, and introduction to formal proof, despite the different ordering in its cover title.
The University of Oxford preliminary computer science examination whose original cover gives Trinity Term 2015, Thursday 25 June, and formal code A10100W1. The released archive contains it as 2015-cs3.pdf: publicly released examination archive. Printed pages 2–4 contain Questions 1–3; pages 5–7 contain Questions 4–6; pages 8–10 contain Questions 7–9.
The printed codomain in Question 2(b) is inconsistent with its formula, and an unrestricted zero extension of the binomial coefficients makes the premise in (ii) vacuous beyond the finite row. Question 6(b) retains the initial profile on , which is incompatible with continuity at the upper initial corner unless but is meaningful on the printed open ranges. Question 9(c)(iii) omits the integration variable after both differential signs. These are source qualifications, not missing source material.
The ten-page University of Oxford Computer Science Prelims paper dated 26 June 2014. The public released examination archive contains it as 4223.pdf. Question 1's displayed function requires a domain restriction. Question 3's fractional-size recurrence relation needs a base case and an integer-rounding convention. Question 6's parameter range includes negative values, so the critical-point classification requires a split at as well as ; its final derivative request also has a typographical superscript on . These points were checked against printed pp. 2, 4 and 7.
The nine-page University of Oxford Computer Science Prelims paper dated 20 June 2013. The public released examination archive contains the original scan as 4223-1.pdf. Printed pages 2–4 cover discrete mathematics, pages 5–6 cover calculus and ordinary differential equations, and pages 7–9 cover probability theory. Question 8(c)(i) introduces the two-roll model without asking for a separate calculation; Question 8(c)(v) allows the trivial independence of an impossible event unless the values are restricted to the two marginal supports.
A digitized volume of historical University of Oxford examinations. The First and Second Examination paper labels restart each year. Only the month and year are printed on the 1867 papers; page locators here refer to the PDF volume, not printed page numbers.
Wellcome Collection marks this digitized volume with the Public Domain Mark. The original was supplied by Royal College of Physicians, London. The original questions can therefore accompany the solutions here.[ref]
Four-page University of Oxford Finals examination, Trinity Term 2015, dated Tuesday 16 June 2015, 9:30 am–11:00 am. The original marks Questions 1 and 3 as corrected. Printed p. 2 concerns Horn clause proof search and admissible heuristics; p. 3 concerns a STRIPS encoding of a multi-stack Tower of Hanoi puzzle; p. 4 concerns constraint satisfaction problems, tree decomposition, and all-different constraints.
Public archive: Lawrence Attachment.zip, member 2015-is.pdf.
Held original: pdf/computer-science/finals/intelligent-systems/2015.pdf in the Oxford examinations repository. Editable transcription: tex/computer-science/finals/intelligent-systems/2015.tex.
The University of Oxford computer science Finals paper dated Thursday 4 June 2015, 2:30 pm–4:00 pm, Trinity Term 2015. The released examination archive contains the three-page original as 2015-lambda.pdf. Questions 1–2 occupy printed p. 2 and Question 3 printed p. 3. The local sources in the Oxford examinations repository are pdf/computer-science/finals/lambda-calculus-and-types/2015.pdf and tex/computer-science/finals/lambda-calculus-and-types/2015.tex. Question 2(d)'s literal claim is false: its proposed typing judgment holds precisely when for some simple type .
The four-page University of Oxford Finals computer science examination held on 10 June 2015, Trinity Term 2015. Public primary-source archive: Lawrence Attachment.zip, member 2015-landp.pdf. Printed p. 4, Question 3(d), permits an arbitrary quantifier-free formula in an asserted least Herbrand model equivalence; that assertion fails when negative atoms are allowed, even for a satisfiable Horn clause.
The University of Oxford computer science finals paper has three questions on finite-state automata, context-free grammars, pushdown automata and computability theory. The printed cover gives Friday 12 June 2015, 2:30 pm–4:00 pm. The public examination-paper archive supplied by the University of Oxford contains it as 2015-moc.pdf; questions occupy printed pages 2–3.
The seven-page University of Oxford computer science Finals paper dated Thursday 11 June 2015, 2:30 pm–4:00 pm. The released public examination archive contains it as 2015-oop.pdf. Questions 1–3 occupy printed pp. 2–7; Question 3 is explicitly marked corrected. The calendar example on p. 3 interprets its starting offset in weekday cells. The axes upper-corner expression on p. 5 has an extra closing parenthesis; its coordinatewise bounds remain readable. Figure 3 on p. 7 shows the supporting baseplate.
The four-page University of Oxford Finals compiler examination dated Thursday 4 June 2015, Trinity Term 2015. The cover permits answers to two of three questions. Public primary-source archive: Lawrence Attachment.zip, member 2015-compilers.pdf. The paper concerns ordered case statements with expression-valued labels, nested procedure environments, and common subexpression elimination for array swaps.