COMPSCI 61A Lecture 30: CS61A-Lecture 11-07-2016

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

Document Summary

Homework party wednesday 11/09 6:30-8:30pm in 247 cory. Bonus point for submitting a complete project by wednesday 11/16 @ Project party thursday 11/10 6:30-8:30pm in 247 cory. The completely optional scheme recursive art contest entries are due monday. No lecture, discussion section, or o ce hours on friday 11/11. Discussion attendance still counts this week and can be earned by attending discussion (recommended), or completing the online participation form by wednesday 11/09 @ 11:59pm. Map, lter, and reduce express sequence manipulation using compact expressions. Example: sum all primes in an interval from a (inclusive) to b (exclusive) Only true because of lazy implementation of lter and range (only keep track of next, not all the values at once) is_prime and sum_primes can also be implemented using sequence operations like all and map. Sequence operations can also be used and de ned in scheme similarly. However, we lost some e ciency because we have not used iterators here in scheme.