Fall 2014 Exam 2

From CS 61A Wiki
Revision as of 11:05, 22 October 2014 by Andrew (Talk | contribs)


Jump to: navigation, search

Useful things will show up here in the next few days.--169.229.14.214 11:55, 22 October 2014 (PDT)

Midterm 2 Topics

Here is a list of things that we'll focus on this midterm.

  • Data abstraction
    • Functional pairs
  • The sequence abstraction
    • Lists
      • List comprehensions
    • Ranges
    • Strings
    • apply_to_all, keep_if, and reduce
  • For statements
  • Dictionaries
    • Dictionary comprehensions
  • Linked lists
  • Rooted trees
  • Mutable data
    • Identity vs. equality
    • Nonlocal statements
    • Object Oriented Programming
      • Class statements
      • Invoking methods
      • Dot expression evaluation
      • Attribute assignment
      • Bound methods vs functions
      • Class vs instance attributes
      • Inheritance
      • Property methods
  • Interfaces
    • str and repr strings
    • Type dispatching
    • Type Coercion
    • Special methods
  • Counting calls and frames
    • Memoization
  • Orders of growth
  • Sets
  • Binary search trees

Midterm 1 Topics

The upcoming midterm is cumulative, meaning you're expected to be familiar following midterm 1 topics.

  • Primitive expressions
  • Call expressions
  • Import statements
  • Expression trees
  • Assignment statements
  • Pure and non-pure functions
  • Def statements and user-defined functions
  • Applying user-defined functions
  • Environments
  • Environment diagrams
  • Arithmetic operators
  • Local assignment
  • Conditional statements
  • Boolean contexts
  • Boolean operators
  • Iteration with while statements
  • Passing functions as arguments
  • Nested def statements
  • Functions as returned values
  • Lambda expressions
  • Currying
  • Recursive functions
    • Mutual recursion
    • Tree recursion

Skills