Template:ExamCatalog

Prelims

Functional Programming and  Design & Analysis of Algorithms

[[doc:{{{2}}}/2018-fpdaa.pdf|2018]]

[[doc:{{{2}}}/2017-fpdaa.pdf|2017]]

[[doc:{{{2}}}/2016-fpdaa.pdf|2016]]

[[doc:{{{2}}}/2015-fpdaa.pdf|2015]]

[[doc:{{{2}}}/2014-fpdaa.pdf|2014]]

[[doc:{{{2}}}/2013-fpdaa.pdf|2013]]

[[doc:{{{2}}}/2012-fpdaa.pdf|2012]]

[[doc:{{{2}}}/2011-fpdaa.pdf|2011]]

[[doc:{{{2}}}/2010-fpdaa.pdf|2010]]

[[doc:{{{2}}}/2009-fpdaa.pdf|2009]]

[[doc:{{{2}}}/2008-fpad.pdf|2008]]

[[doc:{{{2}}}/2007-fpad.pdf|2007]]

* Candidates in Mathematics and Computer Science take a shorter paper on Continuous Mathematics and Probability; candidates in Computer Science and Philosophy take a shorter paper on Discrete Mathematics and Probability. In each case, the questions set were the same as those on the full paper.

Part A core

Compilers

[[doc:{{{2}}}/2018-compilers.pdf|2018]]

[[doc:{{{2}}}/2017-compilers.pdf|2017]]

[[doc:{{{2}}}/2016-compilers.pdf|2016]]

[[doc:{{{2}}}/2015-compilers.pdf|2015]]

[[doc:{{{2}}}/2014-compilers.pdf|2014]]

[[doc:{{{2}}}/2013-compilers.pdf|2013]]

[[doc:{{{2}}}/2012-compilers.pdf|2012]]

[[doc:{{{2}}}/2011-compilers.pdf|2011]]

[[doc:{{{2}}}/2010-compilers.pdf|2010]]

[[doc:{{{2}}}/2009-compilers.pdf|2009]]

[[doc:{{{2}}}/2008-compilers.pdf|2008]]

[[doc:{{{2}}}/2007-compilers.pdf|2007]]

Basic options

Computer Architecture

[[doc:{{{2}}}/2018-arch.pdf|2018]]

[[doc:{{{2}}}/2017-arch.pdf|2017]]

[[doc:{{{2}}}/2016-arch.pdf|2016]]

[[doc:{{{2}}}/2015-arch.pdf|2015]]

[[doc:{{{2}}}/2014-ca.pdf|2014]]

[[doc:{{{2}}}/2013-ca.pdf|2013]]

[[doc:{{{2}}}/2012-ca.pdf|2012]]

[[doc:{{{2}}}/2011-ca.pdf|2011]]

[[doc:{{{2}}}/2010-ca.pdf|2010]]

[[doc:{{{2}}}/2009-ca.pdf|2009]]

[[doc:{{{2}}}/2008-ca.pdf|2008]]

[[doc:{{{2}}}/2007-comparch.pdf|2007]]

Advanced options

Logic & Proof

[[doc:{{{2}}}/2018-landp.pdf|2018]]

[[doc:{{{2}}}/2017-landp.pdf|2017]]

[[doc:{{{2}}}/2016-landp.pdf|2016]]

[[doc:{{{2}}}/2015-landp.pdf|2015]]

[[doc:{{{2}}}/2014-landp.pdf|2014]]

[[doc:{{{2}}}/2013-logicproof.pdf|2013]]

[[doc:{{{2}}}/2012-logicproof.pdf|2012]]

[[doc:{{{2}}}/2011-logicproof.pdf|2011]]

[[doc:{{{2}}}/2010-logicproof.pdf|2010]]

[[doc:{{{2}}}/2009-logicproof.pdf|2009]]

Part C options

Computational Game Theory

[[doc:{{{2}}}/2019-cgt.pdf|2019]]

Documentation

This higher-order template uses its argument {{{1}}} to format each paper.

• Include 2099=file as an argument to record that the paper for the year 2019 is in file.pdf.
• Include cursed=2099 to record that the paper for 2099 has been used as a source of sample questions published with answers.
• Write nosoln2023=1 if solutions are missing for 2023. Extend this to other years on demand.

The second argument is the server directory that contains the data. Requiring this parameter means that the links which appear on the preview of this page do not work: that's deliberate. You have to visit one of the private pages in the Oxford: or Tutors: namespaces to see the live links.

Table of other templates

• Template:ExamTable – formats a table of exam papers, making up one section of the catalog.
• Template:ExamRecent, Template:ExamFull, Template:ExamMulti, Template:ExamMulti3 – formats a row of the table, showing one of (a) the last five years; (b) all years in one row; (c) all years in two rows; (d) all years in three rows, making space for links to solutions.
• Template:ExamLink – formats a single link to an exam paper; if transcluded from a Tutors' page, the result will include links to solutions and to a discussion page. ExamSrcCell is the same, but for an archive of LaTeX sources.
• Template:ExamRelics, Template:ExamSources – other catalogs, of very old papers, and of tarballs of LaTeX sources.