Difference between revisions of "Fall 2014 Exam 2"

From CS 61A Wiki
Jump to: navigation, search
[unchecked revision][unchecked revision]
(Midterm 1 Topics)
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)
+
Useful things will show up here in the next few days.--[[User:Andrew|Andrew]] ([[User talk:Andrew|talk]]) 22:51, 22 October 2014 (PDT)
  
 
== Midterm 2 Topics ==
 
== Midterm 2 Topics ==
Line 69: Line 69:
 
* Identifying Domain and Range
 
* Identifying Domain and Range
 
* '''Drawing Environment Diagrams!'''
 
* '''Drawing Environment Diagrams!'''
 +
 +
== Review Problems ==
 +
[https://piazza.com/class/hx2jz3h2i112h8?cid=2493 Environment Diagram Practice]

Revision as of 21:51, 22 October 2014

Useful things will show up here in the next few days.--Andrew (talk) 22:51, 22 October 2014 (PDT)

Midterm 2 Topics

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

  • Data abstraction
  • Lists
  • Functional pairs
  • The sequence abstraction
  • For statements
  • Ranges
  • Strings
  • List comprehensions
  • Dictionaries
  • Dictionary comprehensions
  • apply_to_all, keep_if, and reduce
  • Linked lists (both ADT and class representation)
  • Rooted trees (both ADT and class representation)
  • Mutable data
  • Nonlocal statements
  • Identity vs. equality
  • Class statements
  • Invoking methods
  • Dot expression evaluation
  • Attribute assignment
  • Bound methods vs functions
  • Class vs instance attributes
  • Inheritance
  • str and repr strings
  • Interfaces
  • Property methods
  • Special methods
  • Type dispatching
  • Type Coercion
  • 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

  • Identifying the Operator and Operands
  • Identifying Domain and Range
  • Drawing Environment Diagrams!

Review Problems

Environment Diagram Practice