= Functional programming, design and analysis of algorithms
{scope}
{title2=4208}
The solutions use the original 17 June 2014 preliminary examination, code `4208`.<Functional programming, design and analysis of algorithms examination paper by the University of Oxford (2014)>[original scan, pp. 2–8]{ref} <Haskell> definitions use separate question namespaces; names suffixed `F` or `U` distinguish alternative implementations. For Question 4, use `import Prelude hiding (foldr, (++), concat, flip)` when compiling the definitions together. Unless an infinite input is discussed explicitly, inputs are finite and total. Arithmetic operation counts do not include the growing bit costs of exact <integers>.<Haskell 2010 Language Report>[Chapter 9, Standard Prelude; §3.1, undefined values]{ref}
Back to article page
