SHSubjectHub

Theory of Computation quiz games for A-Level Computer Science

2 live games for A-Level Computer Science, 30 questions. Preview every question free. Hosting A-Level Computer Science sets comes with a school package.

Theory of Computation for AQA A-Level Computer Science: 2 ready-made live quiz games, 30 questions in all.

The questions cover Regular Languages (FSM, Regex), Context-Free Languages (BNF, Syntax Diagrams), Turing Machines, Classification of Algorithms (Big-O, Tractability) and Abstraction & Automation.

There are 1 quickfire round and 1 practice set. Question types: 22 true or false, 7 multiple choice and 1 matching.

Preview every set here. Hosting A-Level Computer Science sets comes with a school package, from £150 a year for the whole school.

The gamesEach set is a fixed list of questions. Open a preview to see a few of them.

Quickfire: Theory of Computation

A-level15 questions· Warm-up

Plays in 17 of 17 game modes, including Gold Rush, Big Catch and Speed Blitz.

Preview 3 sample questions
  1. 1

    What is **Backus-Naur Form** (BNF) used for?

    Defining the syntax rules of a programming languageCompiling source code into machine codeDrawing flowcharts for algorithmsEncrypting data for secure transmission
  2. 2

    True or false?

    The empty set ∅ is a subset of every set.
  3. 3

    What does the symbol ∉ mean in set notation?

    unionis a subset ofis NOT a member ofis a member of

+ 12 more questions in the game.

Practice

Theory of Computation: Regular Languages (FSM, Regex)

A-level15 questions· Core

Plays in 17 of 17 game modes, including Gold Rush, Big Catch and Speed Blitz.

Preview 3 sample questions
  1. 1

    True or false?

    Listing {3, 3, 5} describes a set with two distinct elements, 3 and 5.
  2. 2

    Which of the following is **NOT** a component of a Turing machine?

    A read/write head that moves along the tapeAn infinitely long tape divided into cellsA random number generatorA finite set of states and transition rules
  3. 3

    True or false?

    Heuristic approaches can provide approximate solutions to intractable problems in reasonable time.

+ 12 more questions in the game.

How hosting works

  1. Pick a set and a game mode. The questions stay the same; the game changes.
  2. Put the join code on the board. Pupils join at subjecthub.co.uk/play on a phone or laptop. They need no account.
  3. Play for 1 to 7 minutes. You choose the length before you start.

Preview every set free. Hosting these sets comes with a school package. See pricing

See how each game mode plays →

← All A-Level Computer Science games · All live games