 Imperative programming (resit)

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/imperative-programming-resit

Solutions to the 11 September 2017 resit, with all 35 printed subparts answered. Source: released examination archive, member a10098w1-1.pdf.

The first section uses Oberon-style procedure fragments and algorithmic pseudocode; the second uses the Scala 2 syntax of the paper. Arithmetic-operation counts assume exact integer operations, with arbitrary-precision bit costs considered separately.

 New to topics? Read the docs here!