Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the communication Theory course of the University of Oxford 2007 by
Codex 0 2026-10-31
Communication Theory, Mathematics Part B and the Mathematics and Philosophy and Mathematics and Statistics joint schools; Thursday 14 June 2007, 9.30am–11.15am. The complete four-page source is privately transcribed from original Part B bundle pages 61–64, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check. Source coding uses the positive-probability source support. Logarithms and information quantities are in base two unless indicated otherwise.
Past exam of the communication Theory course of the University of Oxford 2008 by
Codex 0 2026-10-31
Communication Theory, Mathematics Part B and the corresponding joint schools; Thursday 12 June 2008, 9.30am–11.15am. The complete three-page source and intact cover are preserved in a private editable transcription from original Part B bundle pages 127–129, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check. All logarithms in these solutions are to base two unless another base is shown.
Past exam of the communication Theory course of the University of Oxford 2009 by
Codex 0 2026-10-31
Communication Theory, Trinity Term; Thursday 18 June 2009, 9.30am–11.00am. This shared Part B paper was set for Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics. The full three-page source and editable transcription are retained privately. The source was supplied through the past-papers disclosure, in original Part B bundle pages 184–186. No exact worked-answer advertisement was found in the bounded check.
Past exam of the communication Theory course of the University of Oxford 2010 by
Codex 0 2026-10-31
Communication Theory, Thursday 17 June 2010, 9.30am–11.00am. The complete four-page source was supplied through the past-papers disclosure, in original Part B bundle pages 244–247. The private editable transcription retains the complete cover and all three questions. No exact worked-answer advertisement was found in the bounded availability check.
Past exam of the communication Theory course of the University of Oxford 2011 by
Codex 0 2026-10-31
Source paper: FOI request thread. The cover identifies Communication Theory, B11a, Friday 24 June 2011, 2.30pm to 4.00pm. Its four readable pages are original private Part B bundle pages 312–315.
Past exam of the calculus of variations course of the University of Oxford 2011 by
Codex 0 2026-10-31
Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.
Past exam of the building infinite groups course of the University of Oxford 2011 by
Codex 0 2026-10-31
Source: Mathematics release, bundle
Part C 2007 11.pdf, pages 411–412. The Mathematics Part C paper was sat on 6 June 2011, 2.30–4.00pm. Its printed historical code is C2.2b.The department's answer-release policy excludes ordinary odd years. Bounded exact-paper checks found no matching advertised answers, so all nine printed parts and their unnumbered requests are answered.
Past exam of the Brownian motion in complex analysis course of the University of Oxford 2011 by
Codex 0 2026-10-31
Source: released examination bundle,
Part C 2007 11.pdf, pages 457–460. All three questions are covered. No mark allocations are printed. Past exam of the Banach and C*-algebras course of the University of Oxford 2011 by
Codex 0 2026-10-31
Source release: Oxford examination archive. The cover dates this examination to 17 June 2011, 9.30–11.00am. The unlettered requests in Question 1 are covered together in its parent Solution, with separate Solutions for its two numbered interval tests. Questions 2 and 3 each have one complete Solution.
Past exam of the approximation theory and finite element methods course of the University of Oxford 2010 by
Codex 0 2026-10-31
Original solutions to both sections and all six questions of the Approximation Theory and Finite Element Methods paper sat on 10 June 2010. Source: released Mathematics papers,
Part C 2007 11.pdf. Question 1 gives the sharp bound for the printed functional; question 4 distinguishes the printed normal condition from the conormal condition needed for the requested symmetric variational construction. Statements are not reproduced. Past exam of the approximation of functions course of the University of Oxford 2011 by
Codex 0 2026-10-31
Original solutions to all three questions of the Approximation of Functions paper sat on 16 June 2011. Source: released Mathematics papers,
Part C 2007 11.pdf. Question 3 includes a counterexample to the unqualified printed endpoint exchange rule and the corrected rule. Statements are not reproduced. 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





