Mini projects

• Mini-project: Functional abstraction and instantiations
  • Task
  • Resource
  • Version
• Mini-project: The underlying determinism of OCaml
  • Resources
  • Question 01
  • Answer to Question 01
  • Interlude
  • Question 02
  • Question 03
  • Question 04
  • Question 05
  • Question 06
  • Question 07
  • Question 08
  • Pure and impure expressions
  • Question 09
  • Question 10
  • Question 11
  • Question 12
  • Food for thought about lexical scope
  • Solution for the first expression
  • Solution for the second expression
  • Resources
  • Version
• Mini-project: Cracking polynomial functions
  • Resources
  • First degree
  • Solution for the first-degree task
  • Interlude
  • Second degree
  • Zeroth degree
  • Third degree
  • Fourth degree (time permitting)
  • A generalization
  • Resources
  • Version
• Mini-project: Palindromes, string concatenation, and string reversal
  • Resources
  • Question 01
  • Question 02
  • Answer to Question 02
  • Question 03
  • Question 04
  • Question 05
  • Question 06
  • Palindromes
  • Question 07
  • Interlude
  • Question 08
  • Question 09
  • Question 10
  • Question 11
  • Question 12
  • Question 13
  • Question 14
  • Question 15
  • Question 16
  • Question 17
  • Question 18
  • Question 19
  • Question 20
  • Resources
  • Version
• Mini-project: The power of recursion
  • Task 1
  • Task 2
  • Task 3
  • Task 4
  • Task 5
  • Task 6
  • Task 7
  • Task 8
  • Resources
  • Version
• Mini-project: A simple variant of the knapsack problem
  • Resources
  • Acknowledgment
  • Version
• Mini-project: A study of right-to-left linked lists
  • Prelude
  • Resources
  • Version
• Mini-project: Computing the width of a binary tree
  • Task 1
  • Task 2
  • Task 3
  • A witness (imperative) implementation
  • Task 4 (optional)
  • Resources
  • Version
• Mini-project: Implementing a sieve
  • Question 1
  • Question 2
  • Question 3 (very, very simple)
  • Question 4
  • Resources
  • Version
• Mini-project: Depth-first and breadth-first traversals
  • Extensional question #1
  • Extensional question #2
  • Extensional question #3
  • Intensional question #1
  • Intensional question #2 (time permitting)
  • Closing question (for the over-achievers)
  • Resources
  • Version
• Mini-project: Indexing data structures
  • Indexing strings
  • Indexing arrays
  • Indexing lists
  • Indexing lazy lists
  • Indexing streams
  • Indexing imperative lists
  • Indexing binary trees
  • Food for thought about indexing from left to right and from right to left
  • Resources
  • Version
• Mini-project: Multiplying integers in a tree using an accumulator
  • Task 1
  • Task 2
  • Task 3
  • Task 4
  • Resources
  • Version
• Mini-project: Three program processors for arithmetic expressions
  • The source language
  • Source abstract syntax
  • The overarching goal
  • A source interpreter for arithmetic expressions
  • Task 1
  • The target language
  • Byte-code instructions
  • Target abstract syntax
  • A processor for byte-code instructions
  • Task 2
  • A virtual machine for byte-code programs
  • A sample of executions
  • Task 3
  • Solution for Task 3
  • A compiler from arithmetic expressions to byte-code programs
  • Task 4
  • Task 5
  • The capstone
  • Task 6
  • Task 7
  • Task 8
  • Resources
  • Version