Exercises
Mandatory exercises
None.
Recommended exercises
- Exercise 1:
investigating the equivalence of functions operating over lists
- Exercise 2:
adding the results of iota and atoi pointwise
- Exercise 4:
implement set intersection using an accumulator
- Exercise 5:
implement set difference using an accumulator
- Exercise 7:
instantiating fold_right_list with nil and cons
- Exercise 9:
implement set intersection using fold_right_list
- Exercise 10:
implement set difference using fold_right_list
- Exercise 13:
instantiating fold_left_list with nil and cons
- Exercise 16:
implement set intersection using fold_left_list
- Exercise 17:
implement set difference using fold_left_list
- Exercise 15:
implementing the Cartesian product of four sets
- Exercise 12:
implementing the Cartesian product of four sets
using fold_right_list
- Exercise 24:
computing the last element of a list, if any
- Exercise 25:
implementing right-to-left polymorphic lists
- Exercise 28:
computing the weight of any given binary tree of integers
- Exercise 29:
testing whether a given binary tree of integers represents a
well-balanced mobile
- Exercise 30:
an alternative representation of polymorphic binary trees
where the payload is in the nodes
- Exercise 32:
computing the height of a binary tree, generically
- Exercise 31:
an alternative representation of polymorphic binary trees
where the payload is both in the leaves and in the nodes
- Exercise 36:
playing with the fold-right function associated to the alternative
representation of polymorphic binary trees where the payload is in the
nodes
Version
Rebalanced
[24 Mar 2020]
Lightened
[19 Mar 2020]
Stripped
[14 Mar 2020]
Created
[17 Mar 2019]