Personal tools
You are here: Home → Classes → Fall 2005 → CS 275 → Downloads & Links → Midterm Summary
Navigation
Log in


Forgot your password?
« July 2008 »
Su Mo Tu We Th Fr Sa
12345
6789101112
13141516171819
20212223242526
2728293031
 
Document Actions

Midterm Summary

by rms — last modified 2005-10-16 11:07
CS 275 -- Midterm Summary CS 275 -- Midterm Summary

  1. Scheme Programming Techniques
    1. Basic Scheme interpreter
      1. constants
      2. variables
      3. combinations
      4. quotes
      5. conditionals
      6. lambdas
    2. S-expression language
      1. atoms
      2. lists
        1. car, cdr and cons
      3. local bindings
        1. let and letrec
    3. "Little Schemer" style programming (Chapters 1 - 6)
      1. recursion on atoms and lists
        1. rember, subst, append, etc.
        2. *-functions
      2. functions on numbers
    4. Higher order functions
      1. map
      2. fold
      3. curry
      4. compose
  2. Lambda Calculus
    1. Expression syntax
      1. free and bound variables
    2. Conversion and reduction rules

  3. Binding and Scope
    1. free and bound variables
    2. lexical binding
    3. variable scope
      1. contour diagrams
      2. lexical depth
    4. lexical address
    5. static vs. dynamic binding
      1. static and dynamic environments
        1. need for procedures to store static environments
      2. pros and cons of using static or dynamic binding

  4. Abstract Data Types
    1. Cons-box diagrams
    2. define-datatype
      1. variant data types
      2. components
      3. operator types: constructors, selectors, recognizers
    3. Examples: binary trees
    4. Abstract and concrete syntax
      1. Parsing and unparsing
last modified October 13, 2005 by rms@cs.oberlin.edu

 
Powered by Plone CMS, the Open Source Content Management System

This site conforms to the following standards: