The eight-page Preliminary Examination in Computer Science, Paper 1, Long Vacation 2003. Original source: Released examination archive, member 4213-1.pdf. Printed pp. 2–3 cover functional programming, p. 4 covers algorithms, pp. 5–6 cover imperative programming, and pp. 7–8 cover digital electronics. The timing diagram on printed p. 8 permits a new clock cycle pulse immediately after a cycle that rearms the circuit.
Original seven-page Preliminary Examination in computer science, Long Vacation, 25 September 2003. Released in the examination archive, member 4214-1.pdf. The printed cover identifies Paper 2. Question 7's definition of a directed set does not exclude the empty set; under that convention its completeness assumption also requires a least element.
Original six-page Preliminary Examination, Long Vacation 2005, released as member 4213.pdf of the examination archive. Printed p. 2 has identical right folds on the two sides of Question 1(c). Printed p. 5 says “even” for a list of odd prime numbers in Question 9(b). Both readings are visible in the original scan.
Original University of Oxford Preliminary Examination in Computer Science, 22 September 2005. Released in the examination archive, member 4214.pdf, six printed pages.
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).
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.
Original preliminary examination, 11 June 2013, seven pages. Released archive: Freedom of Information release, member 4208-1.pdf.
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.
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.
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 ; for nonpositive inputs the meaningful extension uses .
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.
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 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 as an expected value; its assertions in Question 2(b) and (c) are false for two bins, rather than transcription gaps.
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.
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 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 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.
Section 2 states the selection condition and Horn calculus used by resolution with free selection.
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.
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.
Section 9.21 documents the arithmetic mean computed by AVG, ignored null inputs, and the result for an empty input.
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.
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 .
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 wait, notify and notifyAll entries specify monitor release and reacquisition, arbitrary choice of notified waiters, and the possibility of spurious wakeups.
Original paper, pp. 1–6. The local source is pdf/computer-science/finals/concurrent-programming/2015.pdf in the Oxford examinations repository; the reviewed transcription is tex/computer-science/finals/concurrent-programming/2015.tex. Archive member: 2015-concprog.pdf.
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.
§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 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.
Examination dated 15 June 2015, seven printed pages. Held source: pdf/computer-science/finals/computer-security/2015.pdf in the Oxford exams repository; editable transcription: tex/computer-science/finals/computer-security/2015.tex. The source bundle identifies this member as 2015-security.pdf.
Section 4.2.2.17 explains why TCP must recover from a lost window-reopening acknowledgement. Section 4.2.3.4 discusses Nagle's algorithm.
Historical discussion of the small-packet problem and the sender rule associated with Nagle's algorithm.
Sections 2–3 define sender variables and the TCP congestion control mechanisms.
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.
Section 2 defines IP multicast; Appendix I specifies membership query, report and timer behaviour.
Sections 5.1–5.2 specify the flag and bit stuffing for bit-synchronous transmission.
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 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.
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 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 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 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.
By Armin Biere, Alessandro Cimatti, Edmund Clarke and Yunshan Zhu. Published in Tools and Algorithms for the Construction and Analysis of Systems, volume 1579, pp. 193–207.
Introduces bounded model checking by translating a search for a bounded counterexample into a Boolean satisfiability problem. Section 2 explains unrolling and loop closure through a worked example; §3 states infinite-path semantics; §4 gives the encoding; §5 discusses bounds.
Hilary Term 2023 lecture slides. Slides 47–48, on PDF pp. 62–63, state the linear speedup theorem for tapes and explain the block simulation. The source is used for that general theorem, not as an answer key for an examination.
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.
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 “Variance Annotations” section specifies variance positions and lower-bound widening, used when an immutable class's output type parameter is covariant while a method must accept a possibly broader output value.
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.
Primary source: released examination archive, member a10100w1-4.pdf. The original eleven-page cover identifies the Preliminary Examination in Computer Science, Long Vacation 2015, Wednesday 9 September. The archive folder name is not the examination year. Page 8, Question 6(b)(iii), explicitly identifies “saddle point” with “point of inflexion”; that usage is specific to this paper. The definition in Question 6(a)(ii) leaves endpoint values unspecified, which does not affect its Fourier series.
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 compiler's methodSig, typesFromOverridden, and assignTypeToTree use an inherited return type as an expected type when checking an overriding method body. This permits numeric widening of a literal in that body while still inferring more specific reference result types where appropriate.
Specifies method overloading, numeric widening, and instance method selection in Scala.
Defines Scala trait linearization, inherited member lookup, and evaluation of trait initialization statements.
The official archived API documents lazy lists, memoization of their evaluated values, and retention of cached tails while earlier cells remain reachable. The companion object supplies Stream.iterate for repeated function application. This source documents the Scala 2.12 API family; it does not establish the exact compiler patch release used for a historical examination.
Original Czech article in Práce Moravské přírodovědecké společnosti 3, pp. 37–58. The opening formulation assigns pairwise distinct positive costs to connections and asks for minimum total cost while retaining connection between all points.
Official historical API documentation for the mutable stack: the empty constructor, push, pop and nonEmpty support an explicit inorder traversal stack. The API's deprecation notices concern later collection choices; they do not remove these documented operations from the cited version.
Original article in Journal of the ACM 32(3), pp. 652–686. Author-hosted publication record and abstract: www.cs.cmu.edu/~sleator/papers/Self-Adjusting.htm
The article introduces splay trees and proves a logarithmic amortized time complexity for their standard operations.
The archived course record links the teaching site spivey.oriel.ox.ac.uk/corner/Digital_Systems, whose current process/message-based system material is at spivey.oriel.ox.ac.uk/corner/Micro:bian_(Digital_Systems). The latter is later documentation and does not establish an identical API for the Phōs release named in the held 2019 examination. The solutions specify the request, interrupt and reply contracts explicitly rather than claiming such a binding.
Primary refactoring catalog entry, also named Move Method in the first edition. The example moves behavior to a context better suited to its responsibility. The 2019 solution uses the underlying design principle rather than requiring a particular later tool or library API.
Relevant locator: Relations between types, Conformance, parameterized types and covariant parameters. This specifies when an iterator of a subtype can be viewed as an iterator of a supertype; it does not imply that existing iterator contents are numerically converted.
Archived official Scala API. Relevant locators: the abstract members hasNext and next, the exhaustion exception, and the consuming nature of iterators. The associated historical overview is Collections for Scala 2.8–2.12: Iterators.
Primary author-published account of a code smell, with the long-method example and the qualification that a smell calls for investigation rather than automatic rejection.
Relevant locators: remainder %, gcd, isValidInt and toInt. Scala's BigInt provides arbitrary-precision integer arithmetic; representability must be checked before conversion to a fixed-width integer because narrowing conversion need not preserve the exact value. The archived API corroborates the operations used in the solution without claiming a particular installed Oxford course library version.
Primary package documentation for GoodmanKruskalGamma, SomersDelta and Lambda. The Details sections specify the tied-pair exclusion in Goodman and Kruskal's gamma, directional denominators for Somers' D, and modal-prediction interpretation of Goodman and Kruskal's lambda. These definitions corroborate mathematical interpretation; the documentation does not identify the implementation or version of an unspecified oii.xtab wrapper in a past examination.
Archived draft-ietf-quic-transport-24, explicitly work in progress. The later publication notice on the live archive page is not treated as knowledge available in January 2020.
Standards-track SMTP specification; sections 2.1–2.3 describe the basic and relaying models.
Informational analysis separating end-to-end functions, performance and address transparency, with discussion of intermediaries and IPv6.
Standards-track IPv6 specification, including expanded addressing and header changes.
Standards-track TLS 1.3 specification; section 1 defines channel security between peers.
Workshop report on transport evolution and interface and middlebox ossification, not an Internet Standard.

Framework for Content Distribution Network Interconnection (RFC 7336) (August 2014)

0 0
Informational framework defining content-provider and delivery-network roles, redirection and content acquisition.
www.rfc-editor.org/rfc/rfc7336.html
Informational architectural discussion of trust, service requirements and intermediaries.
Informational taxonomy distinguishing ordinary forwarding from middlebox functions.
Informational description of traditional address and port translation, associated state and limitations.
The historical TCP specification used for the pre-2020 transport contract, particularly sections 1.5 and 2.6.
The DNS concepts specification, including design goals, distributed maintenance and zones.
Informational architectural guidance; sections 2–3 distinguish the common internetwork interface and end-to-end functions.
Author paper reprint identifying its original SIGCOMM 1988 publication; sections 2–4 discuss goals and survivability.
Author-hosted reprint of the 1984 paper, with its careful-file-transfer example and function-placement argument.

One-sided matchings: house allocation problems in the Cornell networks and markets text (Chapter 13)

0 0
Author-hosted technical text: One-sided Matchings: House Allocation Problems, chapter 13 of A Course in Networks and Markets: Game-theoretic Models and Reasoning.
Relevant locator: §13.2, Definition 13.1 and Theorem 13.2, Pareto efficiency of serial dictatorship with strict preferences. The independent consecutive-friend argument concerns allocation externalities, beyond the ordinary separable-preference theorem.
Primary software documentation for ordinal association measures, including their tie conventions and table-size adjustments.
Official documentation for stats::summary.lm. It defines the coefficient columns, residual variance estimate, degrees of freedom and coefficient of determination.
Official documentation for stats::t.test. It specifies the unequal-variance default, the two-sided alternative and the returned confidence interval and estimates.
Official course-hosted technical expositions: 3.3 Expectimax and 3.4 General Games.
Relevant locators: §3.3, weighted chance node backups; §3.3.1, Mixed Layer Types; §3.4, moving players maximize their own coordinate and propagate whole utility tuples. The nearly-zero-sum cutoff is proved independently.
Official course-hosted technical exposition: 3.2 Minimax.
Relevant locator: §3.2.1, Alpha-Beta Pruning, ancestral alternatives and dependence on child order. The solution's alpha-beta pruning code and mathematical comparisons are given explicitly.
Official course-hosted technical exposition: 2.4 Ordering.
Relevant locators: §2.4, Minimum Remaining Values; §2.4.1, Structure, the upward support pass, downward assignment and cutset conditioning. The residual tree computation is linear in the number of variables for fixed maximum constraint domain size.
Official course-hosted technical exposition: 2.3 Filtering.
Relevant locator: §2.3, initial forward-checking definition and subsequent directed support-revision procedure. These describe forward checking, arc consistency and iterative filtering.
Primary CMSIS-Core register-access documentation. The PRIMASK accessors and interrupt-mask operations define the architectural effect of saving, disabling and restoring maskable interrupts on Cortex-M. Compiler ordering is an additional requirement when protecting shared C objects.
Primary instruction manual: Revision 2.00, 9 June 2003. Chapter 3 specifies the instruction encodings and operation semantics used here.
Relevant locator: isFinite(double), parseDouble(String) and toString(double): finite-number validation and numeric text helpers.
Relevant locator: What is TDD?: interleaved coding, unit tests and refactoring, and the short test/implementation cycle.
Relevant locator: Official library README, About Scala-swing: Publisher/Reactor, listenTo, reactions; archived Reactor API at www.scala-lang.org/api/2.12.7/scala-swing/scala/swing/Reactor.html corroborates listenTo, deafTo and reactions. These corroborate the supplied source contract, not a verified 2021 course dependency version.
Relevant locator: Scala standard library 2.13.6: Iterator abstract members hasNext and next, exhaustion, mutation and safe reuse.
Historical official synopsis identifying the Ewoks text-editor case study and topics including commands as software objects and dynamic binding. It is evidence for that earlier course, not an exact copy of a 2021 practical project.
Official language specification covering type parameters, variance annotations, declarations and procedure syntax.
Published in Proceedings of ECAI 1992, pp. 359–363. The paper introduced the SATPlan approach. The bounded model, state-transition formulas and deletion-sensitive proof used here are given explicitly rather than relying on a copied encoding.
Printed section 4.1, especially pp. 97–100, discusses greedy best-first search, A-star search, admissible heuristics and the finite-branching factor/positive-cost completeness conditions. The printed chapter identity is used without inferring an edition from its host directory.
Primary conference paper. Section 3.1 and Appendix A derive the general gradient identity; Section 4 treats baselines. The construction combines random-choice probabilities and differentiable deterministic paths in a stochastic computation graph.
Articles were limited to the first 100 out of 258 total.

Ancestors (2)

  1. Computer science
  2. Home

Incoming links (1)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Computer science bibliography by Ciro Santilli 40 Updated 2025-07-16
Read the full article
See all articles in the same topic Create my own version