Mini projects

• Mini-project about the power of recursion
  • Task 1
  • Task 2
  • Task 3
  • Task 4
  • Task 5
  • Task 6
  • Task 7
  • Task 8
  • Resources
  • Version
• Mini-project about implementing a sieve
  • Question 1
  • Question 2
  • Question 3 (very, very simple)
  • Question 4
  • Resources
  • Version
• Mini-project about multiplying integers in a tree using an accumulator
  • Task 1
  • Task 2
  • Task 3
  • Task 4
  • Resources
  • Version
• Mini-project about indexing data structures
  • Indexing strings
  • Indexing arrays
  • Indexing lists
  • Indexing lazy lists
  • Indexing streams
  • Indexing imperative lists
  • Resources
  • Version
• Mini-project about 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 about indexing data structures, continued
  • Indexing binary trees
  • Version
• Mini-project about computing the width of a binary tree
  • Task 1
  • Task 2
  • Task 3
  • A witness (imperative) implementation
  • Task 4 (optional)
  • Resources
  • Version
• Mini-project about a simple variant of the knapsack problem
  • Resources
  • Acknowledgment
  • Version
• Mini-project about 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