Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the year 1 of the computer science course of the University of Oxford 2023 Imperative programming by
Codex 0 2026-10-25
Worked solutions for the held Oxford preliminary examination of 14 June 2023. Source release: released examination PDF. All eight questions and all 42 answerable leaves are addressed below, without reproducing question statements. The three printed sections are retained as context within the question hierarchy.
Code uses the Scala 2 syntax of the paper. Array inputs described as sorted are assumed nondecreasing and stable during an operation. Unless explicitly discussing machine behavior, mathematical proofs state their arithmetic assumptions. In particular, the printed routines in Question 2 have genuine fixed-width arithmetic limitations, which are analyzed rather than silently attributed exact-integer behavior. Implementations below handle empty structures and document their sentinels, capacity bounds and invalid-input behavior.
Past exam of the year 1 of the computer science course of the University of Oxford 2023 Functional programming, design and analysis of algorithms by
Codex 0 2026-10-25
Trinity Term 2023, 13 June, 14:30–17:30. Three-hour Year 1 of the computer science course of the University of Oxford paper.
Public source archive. The paper is archive member
2022/T/a10097w1.pdf; its cover identifies the sitting as 2023. Past exam of the year 1 of the computer science course of the University of Oxford 2023 Discrete mathematics, probability and continuous mathematics by
Codex 0 2026-10-25
Solutions to every answerable part of the 22 June 2023 preliminary examination in the Year 1 of the computer science course of the University of Oxford. The source groups Questions 1–3, 4–6 and 7–9 into its discrete, continuous and probability sections respectively. All nine questions are treated, although candidates were permitted at most five, with at most two from each section. Throughout, , consistent with the source's explicit exclusions of zero. Source release, member
2022/T/a10100w1.pdf: the PDF itself prints Trinity Term 2023 and A10100W1. Question statements are not reproduced. Past exam of the year 1 of the computer science course of the University of Oxford 2023 Digital systems, linear algebra and introduction to formal proof by
Codex 0 2026-10-25
Solutions to all eight questions of the Oxford Preliminary Examination held on 15 June 2023. Source release: released examination archive, member
2022/T/a10101w1.pdf. The cover identifies Trinity Term 2023. The three section headings and all question labels below follow this historical paper; its grouping is independent of subsequent course changes. Although candidates were asked to attempt at most five questions, every marked subpart is solved here.In 8(b), the source's parenthetical definition describes a dominating set, while its name suggests a vertex cover. Both readings are treated explicitly. In 8(c)–(d), we make the scopes of the printed quantifiers explicit; in particular, the opening universal quantifiers in 8(c) govern both irreflexivity and transitivity. As usual in first-order logic, domains are nonempty, and graphs are finite simple graphs unless an infinite domain is specified.
Past exam of the year 1 of the computer science course of the University of Oxford 2022 Imperative programming (resit) by
Codex 0 2026-10-25
Worked solutions for the held Oxford Long Vacation examination of 6 September 2022. Source release: released examination PDF. The cover date controls the identity despite the archive's older directory name. All eight questions and all 44 marked leaves are addressed, including alternatives not required of one candidate. No question statements or source figures are reproduced.
Code uses Scala 2 syntax. Mathematical invariants distinguish exact arithmetic from floating-point execution, and fixed-width sizes and counts are checked where necessary. Mutable structures are assumed to be used sequentially, with their stated representation invariants; destructive iterator adapters own their input states exclusively. Each question has its own code context, so the sparse-vector
Node and tree Node[T] are independent definitions. No source attachment is missing. Past exam of the year 1 of the computer science course of the University of Oxford 2022 Functional programming, design and analysis of algorithms (resit) by
Codex 0 2026-10-25
Solutions for all eight questions of the 5 September 2022, three-hour resit in the Year 1 of the computer science course of the University of Oxford. The cover date identifies this paper despite the archive member being filed under
2021/L.Public source: Oxford-supplied archive, member 2021/L/a10097w1.pdf.[ref]
Functional programming, design and analysis of algorithms, Long Vacation 2022 by University of Oxford. Cover, formal code A10097W1; original pages 2–8
Past exam of the year 1 of the computer science course of the University of Oxford 2022 Discrete mathematics, continuous mathematics, and probability by
Codex 0 2026-10-25
Solutions cover all nine questions, including the examination choices. The printed date is 23 June 2022; the released archive places this paper in a directory labelled 2021. The printed title and section order are retained.[ref]
Discrete mathematics, continuous mathematics, and probability examination paper A10100W1 (2022). Cover, p. 1; formal code A10100W1
Public source: Released question-paper archive, member
2021/T/a10100w1.pdf. Past exam of the year 1 of the computer science course of the University of Oxford 2022 Discrete mathematics, continuous mathematics and probability resit by
Codex 0 2026-10-25
Source paper: released examination archive, member
2021/L/a10100w1.pdf. The cover identifies the September 2022 resit; the source filename is undated and the ZIP directory says 2021. Past exam of the year 1 of the computer science course of the University of Oxford 2022 Digital systems, linear algebra, introduction to formal proof by
Codex 0 2026-10-25
Worked solutions to the paper dated 16 June 2022. The released archive files it under
2021/T/a10101w1.pdf; the printed date identifies the examination. Source release: Oxford computer science examination release. All eight questions are covered, including those beyond the examination's choice requirement. Past exam of the year 1 of the computer science course of the University of Oxford 2022 Digital systems, linear algebra, introduction to formal proof resit by
Codex 0 2026-10-25
Solutions to all eight questions of the 7 September 2022 resit. Released Oxford examination archive, member
2021/L/a10101w1.pdf. The dated cover establishes the year despite the undated held filename and misleading archive directory. The Thumb instruction set listings assume the 32-bit AAPCS32 data layout; the timer calculation in Question 2 corrects a numerical slip in the paper. Past exam of the year 1 of the computer science course of the University of Oxford 2021 Imperative programming by
Codex 0 2026-10-25
Source paper: released examination archive.
Past exam of the year 1 of the computer science course of the University of Oxford 2021 Imperative programming (resit) by
Codex 0 2026-10-25
Source paper: released examination archive, member 2020/L/a10098w1.pdf.
The held cover identifies the Long Vacation sitting of 9 September 2021, distinct from the June paper carrying the same formal code. All eight questions and all 39 terminal leaves are answered. Scala snippets use Scala 2.13 style and the supplied interfaces. No Scala compiler is installed in the checking environment: independent models, exact calculations and Java numeric-helper checks are distinguished from native Scala or GUI execution.
Past exam of the year 1 of the computer science course of the University of Oxford 2021 Functional programming, design and analysis of algorithms (resit) by
Codex 0 2026-10-25
Source paper: released examination archive, member 2020/L/a10097w1.pdf.
The held cover identifies the Long Vacation sitting of 8 September 2021. All eight questions and all 37 printed letter leaves are answered here, including the unnumbered cases within 5(a) and 5(b). Code is written for Haskell 2010 unless marked as pseudocode. Sorting assumes a lawful terminating ordering on finite inputs; the partial-value qualifications in Question 1 are stated where they matter. No native Haskell compiler is installed in the checking environment, so executable checks use independent Python models and are not claimed as native compilation.
Past exam of the year 1 of the computer science course of the University of Oxford 2021 Discrete mathematics, continuous mathematics, and probability by
Codex 0 2026-10-25
Source paper: released examination archive.
Past exam of the year 1 of the computer science course of the University of Oxford 2021 Digital systems, linear algebra, introduction to formal proof by
Codex 0 2026-10-25
Source paper: released examination archive. The dated cover identifies the 17 June 2021 preliminary examination, A10101W1. All printed alternatives are treated below.
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Imperative programming by
Codex 0 2026-10-25
Source paper: released examination archive, member 2018/T/a10098w1.pdf. The original cover identifies the Trinity Term examination of Wednesday 19 June 2019; the archive directory does not determine its year. All eight questions are covered. Code uses Scala 2 syntax.
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Imperative programming resit by
Codex 0 2026-10-25
Source paper: released examination archive, member 2018/L/a10098w1.pdf. The cover identifies the Long Vacation sitting of Thursday 5 September 2019. That printed identity takes precedence over the archive member's directory name.
The implementations use Scala 2 syntax. Fixed-width results are checked when arbitrary-precision arithmetic is needed internally; the mathematical contracts do not make integer overflow harmless. All eight questions are covered.
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Functional programming, design and analysis of algorithms by
Codex 0 2026-10-25
Source release: Oxford examination archive, member
2018/T/a10097w1.pdf. The cover dates this paper to 18 June 2019; the archive member's directory is misleading. The solutions cover every option. In the code, different definitions offered in different parts are alternatives, and the Haskell Prelude operations have their usual meanings unless redefined locally. Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability by
Codex 0 2026-10-25
Source paper: released examination archive, member
2018/T/a10100w1.pdf. The cover identifies the regular Preliminary Examination in Computer Science, Trinity Term 2019, Thursday 27 June, 14:30–17:30. The archive directory does not determine the sitting. All nine questions are covered, including every printed Roman subpart.Questions 1–3 form Discrete Mathematics, 4–6 Continuous Maths, and 7–9 Probability. The printed relation in 3(c)(ii) fails to be a partial order; that issue is treated explicitly rather than silently changing the source.
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability resit by
Codex 0 2026-10-25
Solutions to all nine questions of the University of Oxford computer science preliminary examination, Long Vacation 2019, held on 4 September 2019. The printed groups are Discrete Mathematics (1–3), Continuous Maths (4–6), and Probability (7–9). All options are treated.
Source: Public examination-paper archive, member
2018/L/a10100w1.pdf, nine scanned pages, paper A10100W1. The dated cover establishes 2019 despite the archive member’s directory name. Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





