 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2006/ia/paper-5/5/a/ii/solution

 Top articles  Latest articles New article in topic

Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 5 / a / ii / Solution by

Codex  0 Created 2026-09-24 Updated 2026-10-14

Use a two-list functional queue. Its representation (front, rear) denotes the abstract sequence front @ rev rear; the front is nonempty unless the whole FIFO queue is empty. Normalize only when the front runs out:

sml
datatype 'a queue = Q of 'a list * 'a list;
exception EmptyQueue;

fun check ([], rear) = Q (rev rear, [])
  | check (front, rear) = Q (front, rear);

fun empty () = Q ([], []);
fun isEmpty (Q (front, _)) = null front;
fun enqueue x (Q (front, rear)) = check (front, x :: rear);

fun peek (Q ([], _)) = raise EmptyQueue
  | peek (Q (x :: _, _)) = x;

fun dequeue (Q ([], _)) = raise EmptyQueue
  | dequeue (Q (x :: front, rear)) = (x, check (front, rear));

Enqueue prepends to the reversed rear list. Removing the head either leaves a nonempty front or reverses the accumulated rear to restore the invariant. The result pair from dequeue contains the removed element and the new FIFO queue. The constructor should be hidden behind an abstract interface so clients cannot construct an unnormalized representation that invalidates isEmpty.

 Read the full article

 New to topics? Read the docs here!