Understanding POWER Multiprocessors (2011) 2026-10-31
Section 2.1 introduces store buffering and message passing. Section 2.2 explains barriers and dependencies, including why a genuine address dependency can order reads while a bare control dependency does not. This source corroborates the general memory model discussion, not the availability of examination answers.
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. PPP in HDLC-like Framing (RFC 1662) 2026-10-31
Historical experimental multicast routing specification; §2 describes reverse-path broadcasting and truncation. The examination solutions discuss the forwarding principles without treating this historical specification as a current deployment recommendation.
TCP Congestion Control (RFC 5681) 2026-10-31
Historical discussion of the small-packet problem and the sender rule associated with Nagle's algorithm.
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. FDR2 User Manual 2026-10-31
§1.2, The CSP View of the World defines CSP events, CSP hiding, CSP refinement and the supported CSP semantic models. This source is cited for the meanings of the models, not for answers to the 2015 examination.
The revised library description is used to identify communication, closure and alternation conventions; it is later than the examination and is not an examination answer source.
Java 8 Object API documentation 2026-10-31
The
wait, notify and notifyAll entries specify monitor release and reacquisition, arbitrary choice of notified waiters, and the possibility of spurious wakeups.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 .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. There are unlisted articles, also show them or only show them.