npe lab/discussion: mon/wed 10:00-11:00pm pt
office hours: fri 5:00-6:00pm pt
week 2: 1/25 - 1/29
lab 01: variables, functions, control
disc 01: environment diagrams, control
week 3: 2/1 - 2/5
lab 02: higher-order functions, lambda expressions
disc 02: higher-order functions, self reference, lambda expressions
week 4: 2/8 - 2/12
lab 03: recursion, tree recursion
disc 03: recursion, tree recursion
week 5: 2/15 - 2/19
lab 04: midterm review
disc 04: none. good luck on midterm 1!
week 6: 2/22 - 2/26
lab 05: list comprehensions, data abstraction, trees
disc 05: lists, mutability, trees
week 7: 3/1 - 3/5
lab 06: nonlocal, mutability, iterators and generators
disc 06: oop, inheritance, iterators and generators
week 8: 3/8 - 3/12
lab 07: oop, linked lists, mutable trees
disc 07: efficiency, linked lists, mutable trees
week 9: 3/15 - 3/19
lab 08: midterm review
disc 08: midterm review
week 10: 3/22 - 3/26
lab 09: spring break :)
disc 09: spring break :)
week 11: 3/29 - 4/2
lab 10: scheme
disc 10: scheme, scheme lists
week 12: 4/5 - 4/9
lab 11: interpeters
disc 11: interpreters
week 13: 4/12 - 4/16
lab 12: tail recursion, macros
disc 12: tail recursion, macros
week 14: 4/19 - 4/23
lab 13: regular expressions, bnf
disc 13: macros
week 15: 4/26 - 4/30
lab 14: final review
disc 14: final review
guide to cs 61a [work in progress]
this is an in-progress unofficial handbook that i hope will help you understand the concepts you may have trouble in while taking 61a. note that this may not be up to date with course material as time goes on, but if you shoot me an email i'd be more than happy to bring it up to speed!