Difference between revisions of "Fall 2014 Exam 2"

From CS 61A Wiki
Jump to: navigation, search
[unchecked revision][unchecked revision]
(Created page with "* Data abstraction * Lists * Functional pairs * The sequence abstraction * For statements * Ranges * Strings * List comprehensions * Dictionaries * Dictionary comprehensions *...")
 
Line 1: Line 1:
 +
Useful things will show up here in the next few days.--[[Special:Contributions/169.229.14.214|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
 
* Data abstraction
* Lists
+
** Functional pairs
* Functional pairs
+
 
* The sequence abstraction
 
* The sequence abstraction
 +
** Lists
 +
*** List comprehensions
 +
** Ranges
 +
** Strings
 +
** apply_to_all, keep_if, and reduce
 
* For statements
 
* For statements
* Ranges
 
* Strings
 
* List comprehensions
 
 
* Dictionaries
 
* Dictionaries
* Dictionary comprehensions
+
** Dictionary comprehensions
* apply_to_all, keep_if, and reduce
+
 
* Linked lists
 
* Linked lists
 
* Rooted trees
 
* Rooted trees
 
* Mutable data
 
* Mutable data
* Nonlocal statements
+
** Identity vs. equality
* Identity vs. equality
+
** Nonlocal statements
* Class statements
+
** Object Oriented Programming
* Invoking methods
+
*** Class statements
* Dot expression evaluation
+
*** Invoking methods
* Attribute assignment
+
*** Dot expression evaluation
* Bound methods vs functions
+
*** Attribute assignment
* Class vs instance attributes
+
*** Bound methods vs functions
* Inheritance
+
*** Class vs instance attributes
* str and repr strings
+
*** Inheritance
 +
*** Property methods
 
* Interfaces
 
* Interfaces
* Property methods
+
** str and repr strings
* Special methods
+
** Type dispatching
* Type dispatching
+
** Type Coercion
* Type Coercion
+
** Special methods
 
* Counting calls and frames
 
* Counting calls and frames
* Memoization
+
** Memoization
 
* Orders of growth
 
* Orders of growth
 
* Sets
 
* Sets
 
* Binary search trees
 
* Binary search trees
  
 +
== Midterm 1 Topics ==
 +
Midterm question
 
* Primitive expressions
 
* Primitive expressions
 
* Call expressions
 
* Call expressions
Line 58: Line 65:
 
* Mutual recursion
 
* Mutual recursion
 
* Tree recursion
 
* Tree recursion
 +
 +
== Skills ==

Revision as of 10:55, 22 October 2014

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

Midterm question

  • 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