Welcome to CS61A!
My name's Jordy Rose, and I'm the TA for section 15 (TTh 3:30-5). Log in, relax, and enjoy the ride.
Office Hour: Fri 12:45-2:00. Remember, you can go to any TA's office hours to get help.
Discussion Problems
- Lambda (λ) and Recursion
- Concepts and practice for Iteration vs. Recursion and Orders of Growth - our discussion problems were taken from these two pages.
- Pairs, Lists, and Data Abstraction
- Practice with Trees
- Scheme-1 concepts
- Practice with data-directed programming (and a bit of message passing)
- Semi-practical thought puzzles in Object-Oriented Programming
- A step-by-step environment diagram, along with how to implement OOP using environments
- Mutation and Vectors.
- An overview of Client-Server Programming (explanation only)
- What does it mean to be correct? and a review of making concurrency safe.
- Practice with streams.
- The Metacircular Evaluator, and a review of lexical and dynamic scope.
- Breaking apart MapReduce.
- Working with the lazy evaluator.
- Understanding logic programming and the query system.
Useful Links
- Course Home
- Useful Unix Shell and Emacs Commands
- Animations explaining DEFINE and LET in terms of LAMBDA. Requires a pretty new version of QuickTime; click to continue.
- Lists vs. Sentences
- Environment practice with EnvDraw
- More practice with environment diagrams
- Vectors vs. Lists
- "To Evaluate", a song for the metacircular evaluator.
- All the Evaluators and What They're For
- Contact me: cs61a-tg@imail.eecs.berkeley.edu
- Contact our reader, Josh: cs61a-rg@imail.eecs.berkeley.edu
About Me
I am a Cocoa programmer at heart these days, working on cool and useful programs for the Mac. I am also an a cappella singer and a member of Theatre Rice. (For those who care, I am a fourth-year undergrad in the L&S CS program.)