Navigate to list of lectures   Alphabetic index   Course home   

Exercises
Programming Paradigms

Introduction to Functional Programming in SchemeExercise 1.1Installing a Scheme System No solution available
 Exercise 1.2Testing functional programs No solution available
 Exercise 1.3A Proper List Predicate *Solution
 Exercise 1.4Construction of symbolic expressions *Solution
 Exercise 1.5Every second element of a list **Solution
 Exercise 1.6Creation of association lists *Solution
 Exercise 1.7Association lists and property lists *Solution
 Exercise 1.8The get-prop function for property lists Solution
 Exercise 1.9Parameter passing in Scheme *No solution available
 Exercise 1.10A calendar language - Some calendar functions ****No solution available
 Exercise 1.11A counterpart to list-tail **Solution
 Exercise 1.12The function butlast **Solution
 Exercise 1.13Lexicographic photo file naming ***Solution
 Exercise 1.14A music language in Scheme ****No solution available
 Exercise 1.15Group formation ***Solution
Recursion and Higher-order FunctionsExercise 2.1The append function **Solution
 Exercise 2.2A list replication function **Solution
 Exercise 2.3More about string-merge *Solution
 Exercise 2.4Sublists of a list **Solution
 Exercise 2.5A variant of number-interval *Solution
 Exercise 2.6A variant of string-of-char-list? **Solution
 Exercise 2.7Using flip, negate, and compose *Solution
 Exercise 2.8Linear string search **Solution
 Exercise 2.9Index in list **Solution
 Exercise 2.10Binary search in sorted vectors ***No solution available
 Exercise 2.11Generating a C-style compare function **Solution
 Exercise 2.12Higher-order functions in 'Functional Programming Languages' **Solution
 Exercise 2.13Iterative mapping function **Solution
 Exercise 2.14Table exercise: transposing, row elimination, and column elimination. **No solution available
 Exercise 2.15A straightforward filter function **Solution
 Exercise 2.16Quantifier Functions **Solution
 Exercise 2.17Playing with curried functions in Scheme *No solution available
 Exercise 2.18Generation of functions with a very flexible signature ***Solution
 Exercise 2.19Generalization of curry-2 and curry-3 ***Solution
 Exercise 2.20Generalized compose ***Solution
 Exercise 2.21Generation of approximations to differentiated functions **Solution
 Exercise 2.22The cartesian product of two sets **Solution
 Exercise 2.23Powerset **Solution
 Exercise 2.24Generation of get-prop Solution
Simulation of other Paradigms and ContinuationsExercise 3.1Points and Rectangle **Solution
 Exercise 3.2Color Point Extensions ***Solution
 Exercise 3.3Representing HTML with objects in Scheme ****No solution available
 Exercise 3.4A discriminant function in continuation passing style **Solution
 Exercise 3.5Trampolining a recursive factorial function without tail calls?! **No solution available
 Exercise 3.6A variant of seesaw that completes both threads ***Solution
 Exercise 3.7Can you read and understand an expression with call/cc? **No solution available
 Exercise 3.8Capturing a continuation when traversing a list ***Solution
Evaluation Order and Infinite ListsExercise 4.1Finite streams Solution
 Exercise 4.2A stream of factorial numbers Solution
 Exercise 4.3Stream appending and stream merging Solution
 Exercise 4.4A stream of square root numbers Solution

Possible solutions can be found on the lecture specific exercise page (first column)

Generated: Tuesday October 3, 2017, 15:47:59