CS 115 - Introduction to Programming I
Syllabus

• Basic Concepts
  • functions
  • abstractions
  • structure
  • algorithms
  • interpreters and compilers
  • computations and computers
  • recursion
• Expressions and Procedures
  • expressions
  • naming and the environment
  • lambda expressions
  • compound expressions
  • substitution model of evaluation
  • conditional expresssions
  • black box abstraction
  • block structure and scope
  • let expressions
• Designing, Testing and Debugging
  • introduction
  • input/output
• Performance Analysis and Probabilisitic Methods
  • orders of growth
  • types of recursion
  • probabilistic methods
• Procedures Revisited
  • procedures as parameters
  • procedures as returned values
• Data Abstraction
  • introduction
  • pairs
  • message-passing
  • representing sets
  • example: Huffman coding
• State
  • assignment
  • local state
  • object-oriented programming
  • environment model of evaluation
  • mutable data
• Streams
  • introduction
  • higher-order procedures
  • maps, filters
  • nested mappings
  • implementing streams
  • infinitely long streams
  • nested mappings over infinite streams
  • modeling local state