Midterm Review

Date: Tuesday 10/22

Time: 6pm-8pm

Location: Northrup Hall (NH) 214 and 216

Structure

• 5-6 questions

• Two hours (not tightly timed)

• Sample Problems

• You will not lose points for syntax errors, as long as it's clear what you intended.

• You will be given a sheet with built-in functions and their type, including higher-order functions.

Topics:

• Lists

  • Pattern matching on lists

  • List Comprehensions

  • Association lists

• Recursion

  • Structural recursion

  • Non-structural recursion

• Higher-order functions

  • Using existing ones

  • Defining and using a higher-order function

  • NO Maybes, Data Types, or Errors

Problem Types:

Problems will be similar to those on the projects and in-class exercises, but no specific algorithms from the projects are covered on the project.

2-3 Solve The Problem

Solve a problem specifically with list comprehensions, recursion, or higher order functions. 

• • Might ask you to do both in one.

  • Might restrict which HoF’s you can use.

  • Helper functions count.

1 Define and use a HoF

• • Define a higher-order function based on a specification.

    • The higher order function should probably be written recursively.

  • Use the higher-order function to solve other problem(s). 

2 Algorithmic Questions

• I give you a problem and you have to figure out HOW to solve it.

• These problems will always admit any solution, but should probably be written recursively.

• Correctness is most important, but Shlemiel matters