OCaml Exercises

This is a collection of OCaml programming exercises for the course CAS CS 320: Concepts of Programming Languages at Boston University. They've been written by me over the last iterations of the course, with help from Ankush Das and others. This page is essentially a course-specific version of

all of which are also valuable resources.

1. Arithmetic

  1. Fahrenheit to Celsius
  2. Factorial, Twice
  3. Number of Digits
  4. Palindromic Integers
  5. Modular Arithmetic
  6. The Fibonacci Sequence
  7. The Collatz Conjecture
  8. Integer Square Root
  9. Integer Exponentiation
  10. Perfect Powers
  11. Greatest Common Divisor
  12. Primality
  13. Number of Factors
  14. Nth Prime Number
  15. Perfect Numbers
  16. Hypotenuse
  17. Sums of Squares
  18. Taxicab Numbers
  19. Total Stopping Time Records
  20. Path Records

2. Lists and Strings

  1. Reverse Append
  2. Reverse Concatenation
  3. Drop Leading
  4. Drop Trailing
  5. Towers of Hanoi
  6. String Triangle
  7. Hourglass
  8. Lookup (Right)
  9. Split by Less-Than
  10. Split At
  11. Splitting Lists
  12. Sum at K
  13. Product Above K
  14. Every K Elements
  15. Every Other
  16. Suffixes
  17. Prefixes
  18. Nub
  19. Splits
  20. Sublists
  21. Permutations
  22. Pairs
  23. Bitonic Sequences
  24. Packing
  25. Grouping
  26. Factoring
  27. The Generalized Fibonacci Sequence
  28. Graph Connectivity
  29. Valid 1D Paths
  30. Split by Whitespace
  31. Split by Whitespace, Correctly
  32. Reversing Strings
  33. Split on Character

3. Sums and Products

  1. Walking Distance
  2. Repeats
  3. All Some
  4. Grouping Integers and Strings
  5. Icy Hot
  6. Height of a Binary Tree
  7. Binary Tree Insertion
  8. Flattening Binary Trees
  9. Sorting by Flattening
  10. Alternating Paths
  11. Counting 2-3 Trees
  12. Summing 3-2 Trees
  13. Recipes by Ingredients
  14. Updating Recent Posts
  15. Sorting Concatenation Lists
  16. Tailing Ordered Fork Lists
  17. Reversing Double Lists
  18. Splitting Rose Trees
  19. Summing Rose Trees
  20. Reversing Rose Trees
  21. Binary Tree to Rose Tree
  22. File Trees
  23. Deepest Parentheses
  24. Allocating Memory
  25. Freeing Memory
  26. Pretty Arithmetic Expressions
  27. Mapping Keys
  28. S-Expressions to Rose Trees
  29. Rose Trees to S-Expressions

4. Higher-Order Programming

  1. Curry
  2. Uncurry
  3. Curry 3
  4. Uncurry 3
  5. Map 2
  6. Filter Map
  7. Prefix Map
  8. All Map
  9. Take While
  10. Drop While
  11. Split By
  12. Filter Any
  13. Filter All
  14. Fold Right 2
  15. Fold Left 2
  16. Mapping Rose Trees
  17. Filtering Rose Trees
  18. Replicate
  19. Cyclic Function Application
  20. Fixpoints
  21. Increasing Sequence
  22. Consecutives
  23. List Convolution and Multiplying Polynomials
  24. Function Maximum
  25. Graph Walks
  26. Random Walks
  27. Last Function Standing
  28. Folding and OUnit