= Functional programming, design and analysis of algorithms (resit)
{scope}
{title2=A10097W1}
Source paper: https://www.whatdotheyknow.com/request/ba_computer_science_past_papers/response/2577745/attach/2/202402%20183%20CS%20Papers.zip?cookie_passthrough=1[released examination archive, member 2020/L/a10097w1.pdf].
The held cover identifies the Long Vacation sitting of 8 September 2021. All eight questions and all 37 printed letter leaves are answered here, including the unnumbered cases within 5(a) and 5(b). Code is written for <Haskell> 2010 unless marked as pseudocode. Sorting assumes a lawful terminating ordering on finite inputs; the partial-value qualifications in Question 1 are stated where they matter. No native <Haskell> compiler is installed in the checking environment, so executable checks use independent Python models and are not claimed as native compilation.
Back to article page
