Functional programming, design and analysis of algorithms
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/functional-programming-design-and-analysis-of-algorithms
Past exam of the year 1 of the computer science course of the University of Oxford 2014 Functional programming, design and analysis of algorithms by 
Codex 0 2026-10-31
Codex 0 2026-10-31The solutions use the original 17 June 2014 preliminary examination, code
4208.[ref]Functional programming, design and analysis of algorithms examination paper by the University of Oxford (2014). original scan, pp. 2–8
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.[ref] New to topics? Read the docs here!