Worked question 13 - Data Representation and Theory of Computation
Data representation and the theory of computation
Original questions written for Revision Library.
This worksheet covers three related strands of the AQA A-Level Computer Science specification. Questions 1, 3, 4, 7, 8 and 14 cover how computers represent numbers: unsigned binary and hexadecimal, two's complement for negative integers, fixed-point binary, and floating-point representation (normalisation, range and precision). Questions 5, 9 and 10 cover how computers represent other kinds of data: characters (ASCII and Unicode), sound (sampling rate and bit depth) and bitmap images (resolution, colour depth and compression). Questions 6 and 11 cover Boolean algebra: the laws used to simplify logic expressions, and deriving a simplified expression directly from a truth table. Questions 2, 12 and 13 cover finite state machines (FSMs) as a model of computation, including tracing, constructing and evaluating them.
Answer and mark scheme
Question 13
| Credit | Answer or working |
|---|---|
| 5-6 | Level 3 A clear, well-developed discussion identifies at least one accurate benefit and one accurate limitation of FSM modelling, with specific, correct reference to a feature of a lift control system an FSM would struggle to capture. |
| 3-4 | Level 2 Some accurate benefit(s) and/or limitation(s) are given, but the discussion is less developed or the link to the lift example is generic or limited. |
| 1-2 | Level 1 A basic, undeveloped statement about FSMs is made, with little or no application to the lift example. |
| 0 | Level 0 No creditable content. |
- Indicative content:
- Benefit: an FSM gives a precise, unambiguous model of every state the system can be in and every transition between them, which can be systematically checked for completeness (e.g. every state has a defined transition for every input) and used to design and test the control logic methodically.
- Benefit: because an FSM has a strictly finite number of states, its behaviour is fully predictable and can, in principle, be exhaustively traced or tested, which is valuable for a safety-critical control system such as a lift.
- Limitation: an FSM's number of states is fixed and finite; if a system needs to remember or count an arbitrarily large or varying amount of information, rather than simply being in one of a small number of states, this either cannot be modelled exactly by a small FSM, or requires an impractically large number of states.
- Applied to the lift: a lift may need to service several floor requests queued at once (e.g. requests from several different floors pending together) and decide an efficient order to visit them; a simple FSM state only records where the lift currently is or what it is currently doing, not the full combination of which floors currently have outstanding requests, so modelling every possible combination of pending requests would need a separate state for every combination, which does not scale well as the number of floors increases.
- Valid overall conclusion: FSMs remain a useful model for the lift's basic modes (e.g. moving up, moving down, idle, doors open) but a full lift controller in practice usually needs extra memory or logic beyond a pure FSM to track multiple pending requests.
Answer: Extended, levels-marked response: award marks holistically against the levels of response grid, using the indicative content as a guide to creditable points; there is no single correct wording.



