Navigate to overview of all exercises in these notes   Alphabetic index   Course home   

Recursion and Higher-order Functions

All exercises in this lecture on a single page

Exercise 2.1The append function **
Exercise 2.2A list replication function **
Exercise 2.3More about string-merge *
Exercise 2.4Sublists of a list **
Exercise 2.5A variant of number-interval *
Exercise 2.6A variant of string-of-char-list? **
Exercise 2.7Using flip, negate, and compose *
Exercise 2.8Linear string search **
Exercise 2.9Index in list **
Exercise 2.10Binary search in sorted vectors ***
Exercise 2.11Generating a C-style compare function **
Exercise 2.12Higher-order functions in 'Functional Programming Languages' **
Exercise 2.13Iterative mapping function **
Exercise 2.14Table exercise: transposing, row elimination, and column elimination. **
Exercise 2.15A straightforward filter function **
Exercise 2.16Quantifier Functions **
Exercise 2.17Playing with curried functions in Scheme *
Exercise 2.18Generation of functions with a very flexible signature ***
Exercise 2.19Generalization of curry-2 and curry-3 ***
Exercise 2.20Generalized compose ***
Exercise 2.21Generation of approximations to differentiated functions **
Exercise 2.22The cartesian product of two sets **
Exercise 2.23Powerset **
Exercise 2.24Generation of get-prop

Generated: Thursday August 9, 2018, 10:17:10