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 $B=A\Rightarrow C$ for some simple type $C$.

Examination dated 3 June 2015, four printed pages. Held source: pdf/computer-science/finals/databases/2015.pdf in the Oxford exams repository; editable transcription: tex/computer-science/finals/databases/2015.tex. The source bundle identifies this member as 2015-db.pdf.

Public source bundle: www.whatdotheyknow.com/request/computer_science_past_exam_paper/response/956037/attach/3/Lawrence%20Attachment.zip?cookie_passthrough=1

Section 9.21 documents the arithmetic mean computed by AVG, ignored null inputs, and the result for an empty input.

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 four-page University of Oxford computer science finals paper dated Wednesday 10 June 2015, 9:30 am–11:00 am. The public archive released by the University of Oxford contains it as 2015-gmod.pdf. Printed pp. 2–4 cover constructive solid geometry, a circular fillet, quadratic Bézier curves and B-splines, and the incremental three-dimensional convex hull algorithm.

Original paper dated 1 June 2015, 2:30–4:00 pm. Released archive: www.whatdotheyknow.com/request/computer_science_past_exam_paper/response/956037/attach/3/Lawrence%20Attachment.zip?cookie_passthrough=1, member 2015-krr.pdf.

Section 2 states the selection condition and Horn calculus used by resolution with free selection.

The profile grammar distinguishes positions where existential and universal restrictions are allowed. Section 4 supplies the RL description logic restrictions and Section 5 gives complexity tables. The EL profile here includes bottom and disjointness; its satisfiability result should not be confused with the trivial satisfiability of EL without bottom.

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.

Official Java API entries: docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html and docs.oracle.com/javase/8/docs/api/java/util/Iterator.html. Locators: Iterable.iterator() and enhanced for support; Iterator.hasNext(), Iterator.next() exhaustion, and optional Iterator.remove().

The eight-page University of Oxford computer science Finals paper dated Thursday 11 June 2015, 2:30 pm–4:00 pm. The released examination archive supplied by the University of Oxford contains it as 2015-popl.pdf. Printed pp. 2–3 concern monad transformers; pp. 4–6 concern continuations, coroutines and semaphores; pp. 7–8 concern a monadic interpreter and recursive closures.

The three-page University of Oxford Finals examination dated 1 June 2015, Trinity Term 2015. The released examination archive contains the original as 2015-probc.pdf. Questions 1–2 occupy printed p. 2; Question 2(f)–(g) and Question 3 occupy printed p. 3. The original p. 2 defines $x_j$ as an expected value; its assertions in Question 2(b) and (c) are false for two bins, rather than transcription gaps.

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 $\alpha =-1$ as well as $\alpha =1$; its final derivative request also has a typographical superscript on $f$. These points were checked against printed pp. 2, 4 and 7.

Primary source: Released examination archive, member 4224.pdf. The original nine-page cover identifies the Preliminary Examination in Computer Science, Trinity Term 2014, Friday 20 June. Questions 1–3 cover digital counters, the MIPS architecture and file systems; Questions 4–6 cover linear algebra; Questions 7–8 use the supplied natural deduction rules in Figures 1–3 on printed page 9.

Released examination archive, member 4208.pdf. The original eight-page paper identifies the preliminary examination held on 17 June 2014. Questions 1–4 concern functional programming and Questions 5–8 concern analysis of algorithms. Question 5(b) permits signed integers but prints a bound containing ${\log }_{2}m$; for nonpositive inputs the meaningful extension uses ${\log }_2\max (2,|m|)$.

Primary source: released examination archive, member 4216.pdf. The original fifteen-page scan identifies the Preliminary Examination in Computer Science and the two joint courses, Trinity Term 2014, Wednesday 18 June. Questions 1–4 are Imperative Programming I; Questions 5–8 are Imperative Programming II.

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.

Original preliminary examination, 11 June 2013, seven pages. Released archive: Freedom of Information release, member 4208-1.pdf.

The 12 June 2013 preliminary examination paper, released as member 4216-1.pdf of Fakour Zip Final 1.zip. Questions 1–4 concern imperative programming and data structures; Questions 5–8 concern Scala object-oriented programming.