Navigate to list of lectures   Alphabetic index   Course home   

Exercises
Programming Paradigms

Introduction to Functional Programming in SchemeExercise 1.1Installing a Scheme System
 Exercise 1.2Testing functional programs
 Exercise 1.3A Proper List Predicate *
 Exercise 1.4Construction of symbolic expressions *
 Exercise 1.5Every second element of a list **
 Exercise 1.6Creation of association lists *
 Exercise 1.7Association lists and property lists *
 Exercise 1.8The get-prop function for property lists
 Exercise 1.9Parameter passing in Scheme *
 Exercise 1.10A calendar language - Some calendar functions ****
 Exercise 1.11A counterpart to list-tail **
 Exercise 1.12The function butlast **
 Exercise 1.13Lexicographic photo file naming ***
 Exercise 1.14A music language in Scheme ****
 Exercise 1.15Group formation ***
Recursion and Higher-order FunctionsExercise 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
Simulation of other Paradigms and ContinuationsExercise 3.1Points and Rectangle **
 Exercise 3.2Color Point Extensions ***
 Exercise 3.3Representing HTML with objects in Scheme ****
 Exercise 3.4A discriminant function in continuation passing style **
 Exercise 3.5Trampolining a recursive factorial function without tail calls?! **
 Exercise 3.6A variant of seesaw that completes both threads ***
 Exercise 3.7Can you read and understand an expression with call/cc? **
 Exercise 3.8Capturing a continuation when traversing a list ***
Evaluation Order and Infinite ListsExercise 4.1Finite streams
 Exercise 4.2A stream of factorial numbers
 Exercise 4.3Stream appending and stream merging
 Exercise 4.4A stream that converges to the square root a number

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

Generated: Tuesday October 2, 2018, 16:02:43