= Imperative programming (resit)
{scope}
{title2=A10098W1}
Solutions to the 11 September 2017 resit, with all 35 printed subparts answered. Source: https://www.whatdotheyknow.com/request/past_exam_papers_for_1st_year_of/response/1398416/attach/2/Fakour%20Zip%20Final%201.zip?cookie_passthrough=1[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.
Back to article page
