View Detailed Profile
61A Fall 2013 Lecture 4 Video 3

61A Fall 2013 Lecture 4 Video 3

Designing Functions.

61A Fall 2013 Lecture 4 Video 1

61A Fall 2013 Lecture 4 Video 1

Lecture 4

61A Fall 2013 Lecture 5 Video 4

61A Fall 2013 Lecture 5 Video 4

Discussion Solution.

61A Fall 2013 Lecture 3 Video 1

61A Fall 2013 Lecture 3 Video 1

Lecture 3

61A Fall 2013 Lecture 5 Video 3

61A Fall 2013 Lecture 5 Video 3

Discussion Question.

61A Fall 2013 Lecture 34 Video 3

61A Fall 2013 Lecture 34 Video 3

MapReduce Evaluation Model.

61A Fall 2013 Lecture 3 Video 6

61A Fall 2013 Lecture 3 Video 6

Solution to choose.

61A Fall 2013 Lecture 18 Video 4

61A Fall 2013 Lecture 18 Video 4

Order of growth.

61A Fall 2013 Lecture 19 Video 3

61A Fall 2013 Lecture 19 Video 3

Implementing sets.

61A Fall 2013 Lecture 17 Video 3

61A Fall 2013 Lecture 17 Video 3

Recursive list class.

61A Fall 2013 Lecture 4 Video 2

61A Fall 2013 Lecture 4 Video 2

Iteration Example: Fibonacci Sequence.

61A Fall 2013 Lecture 2 Video 4

61A Fall 2013 Lecture 2 Video 4

Defining Functions.

61A Fall 2013 Lecture 18 Video 3

61A Fall 2013 Lecture 18 Video 3

Space.

61A Fall 2013 Lecture 13 Video 4

61A Fall 2013 Lecture 13 Video 4

Sequence processing.

61A Fall 2013 Lecture 9 Video 3

61A Fall 2013 Lecture 9 Video 3

Testing.

61A Fall 2013 Lecture 23 Video 4

61A Fall 2013 Lecture 23 Video 4

Let's load this file and see what it does so if we count trees with

61A Fall 2013 Lecture 21 Video 4

61A Fall 2013 Lecture 21 Video 4

Special methods for arithmetic.

61A Fall 2013 Lecture 1 Video 4

61A Fall 2013 Lecture 1 Video 4

Expressions.