= Functional programming, design and analysis of algorithms
{scope}
{title2=4208}
These solutions follow the original examination of 11 June 2013, code `4208`.<Functional programming, design and analysis of algorithms examination paper by the University of Oxford (2013)>[pp. 2–7, Questions 1–8]{ref} Each question's <Haskell> definitions form a separate namespace; hide redefined <Standard Prelude> names when compiling them. Unless stated otherwise, arguments are finite and total. <Time complexity> counts primitive operations; the cost of comparing variable-length words and the growing bit cost of exact <integer> arithmetic are stated separately where relevant.<Haskell 2010 Language Report>[§§3.1 and 4.1; Chapter 9, Standard Prelude]{ref}
Back to article page
