Exercises
The following table lists exercises corresponding to the lectures.
Week | Topic | Recommended | Corresponding Lecture |
---|---|---|---|
36 | Basics | Writing functions 2-4, 6 | Lectures 1 and 2 |
37 | Type Inference | all | Lecture 2 |
Recursion on Lists | or, all, filter, partition, group, foldr, splitAll | Lectures 2 and 3 | |
38 | Datatypes | Natural numbers, Complex numbers, Line | Lecture 4 |
Folds | map, reverse, partition, intersect, tails | Lecture 5 | |
Higher order Functions | Currying, Filter | ||
38-39 | Trees | Lecture 6 | |
39 | Case Studies | Lecture 7 | |
40 | Input/Output | Lectures 9 and 10 | |
41 | Laws and Induction. | Lecture 11 | |
42 | Testing | Lecture 12 | |
42 | Lazy Evaluation. | Lecture 13 | |
43 | Functors, Monads, etc. | Lecture 14 |
Additional Exercises
Exams of Previous Years
See the exams page.
Interactive Exercises
If you like a more interactive approach, Ask-Elle and exercism.io provide Haskell exercises which are automatically corrected.