COMPSCI 61A Lecture Notes - Lecture 19: Memoization, Mutation

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Homework party monday 10/10 6:30-8:30 in 247 cory. Bonus point for completing the project by thursday 10/13 @ 11:59pm. Project parties tuesday 10/11 and wednesday 10/12 6:30-8:30 in 247. Complete the participation form by thursday 10/13 @ 9:30am. A tree has a root value and a list of branches; each branch is a tree. Accessing object attributes is simple; selector functions are not necessary. Demo with tree object system (in le ex. py) Memoization can be used to keep track of bonacci values and not have to recompute for the bonacci tree. Removing subtrees from a tree is called pruning. Pruning out all memoized or repeated branches in the b tree. Make the recursive call to prune each of the branches" branches. Pick a positive integer n as the start. If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1.