Exercises for Week 13

Exercise 0

1. At the top right and at the bottom right of the present page, there is a clickable word, “index”, to access the index of the current version of the lecture notes. Click on it and then peruse the index, making sure that its entries make sense to you (otherwise, click on them to check them out).
2. The lecture notes start with updates (Chapter Lecture Notes for Intro to CS, updates). Make sure to check them out regularly, as they reflect the development of the lecture.
3. Do take the time to peruse the lecture notes of this week and to reproduce their OCaml content.

Mandatory exercises

• Exercise 2: studying the unit-test function for “last in, first out” queues
• Exercise 3: studying the unit-test function for “first in, first out” queues
• Exercise 4: investigating “last in, last out” and “first in, last out” queues
• Exercise 7: exploring tree traversals
• Exercise 15: playing with functors

Harald: These lecture notes contain the solutions for most of the exercises, don’t they?

Alfrothul: Yes they do.

Brynja: What about the exercise below, though?

Mimer: This one is for fun.

Brynja: Sheer exuberance, eh?

Mimer: You said it.

Exercise 15

Characterize the effect of Foo_maker, Bar_maker, and Baz_maker in the resource file for the present lecture note.

Resources

• The OCaml code for the present lecture note (latest version: 03 Apr 2021).

Version

Created [03 Apr 2021]