04-BS-16
Worked solutions to 8 past sittings (2013–2016), 96 questions. Pick a sitting, or start from a topic below.
Topics across the sittings
Topics that come up in more than one sitting, taken from the headings of our worked solutions. A topic counts once per sitting.
- Algorithm Analysis (2 sittings): December 2013 Q8 · May 2013 Q6
- Conditional Probability (2 sittings): December 2013 Q7 · May 2013 Q12
- Dice (2 sittings): December 2013 Q7 · May 2013 Q8
- Discrete Probability (2 sittings): December 2013 Q7 · May 2013 Q8
- Graph Theory (2 sittings): December 2013 Q9 · May 2013 Q10
- Logic (2 sittings): December 2013 Q1 · May 2013 Q1
- Planarity (2 sittings): December 2013 Q9 · May 2013 Q10
- Power Sets (2 sittings): December 2013 Q2 · May 2013 Q4
- Relations (2 sittings): December 2013 Q4 · May 2013 Q5
Questions by sitting
December 2016
- Question 1
- Question 2
- Question 3
- Question 4
- Question 5
- Question 6
- Question 7
- Question 8
- Question 9
- Question 10
- Question 11
- Question 12
May 2016
- Question 1
- Question 2
- Question 3
- Question 4
- Question 5
- Question 6
- Question 7
- Question 8
- Question 9
- Question 10
- Question 11
- Question 12
December 2015
- Question 1
- Question 2
- Question 3
- Question 4
- Question 5
- Question 6
- Question 7
- Question 8
- Question 9
- Question 10
- Question 11
- Question 12
December 2014
- Question 1
- Question 2
- Question 3
- Question 4
- Question 5
- Question 6
- Question 7
- Question 8
- Question 9
- Question 10
- Question 11
- Question 12
May 2014
- Question 1
- Question 2
- Question 3
- Question 4
- Question 5
- Question 6
- Question 7
- Question 8
- Question 9
- Question 10
- Question 11
- Question 12
December 2013
- Question 1: Logic — Quantified Statements and Predicates
- Question 2: Sets — Union, Intersection, Cartesian Product, Power Set
- Question 3: Induction and Pigeonhole Proofs
- Question 4: Relations — Divisibility on a Finite Set and on the Positive Integers
- Question 5: Functions — Domain, Range, Injectivity, Surjectivity, Invertibility
- Question 6: Counting — Multiset Permutations and Stars-and-Bars
- Question 7: Discrete Probability — Dice and Conditional Probability
- Question 8: Algorithm Analysis, Big-O, and Growth-Rate Ordering
- Question 9: Graph Theory — Euler Paths and Planarity
- Question 10: Insertion Sort — Best, Worst, and Big-O Complexity
- Question 11: Euler's Polyhedron Formula
- Question 12: Chromatic Number and Graph-Colouring Scheduling
May 2013
- Question 1: Logic — Propositions, Compound Propositions and Quantifiers
- Question 2: Mathematical Induction
- Question 3: Pigeonhole and Induction Proofs
- Question 4: Power Sets, Partitions, and Set-Builder Families
- Question 5: Relations — Reflexive, Symmetric, Antisymmetric, Transitive
- Question 6: Algorithm Analysis and Big-O Notation
- Question 7: Permutations, Combinations, and Multiset Arrangements
- Question 8: Discrete Probability — Dice and Seating
- Question 9: Pigeonhole (Ramsey R(3,3)) and Inclusion-Exclusion
- Question 10: Graph Theory — Paths, Planarity, Algorithms, Colouring
- Question 11: Euler's Formula for Planar Graphs and Polyhedra
- Question 12: Conditional Probability and the Binomial Distribution