COMPSCI 61A Lecture 20: CS61A-Lecture 10-12-2016

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

Document Summary

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. Homework 8 (small and quick) due tuesday 10/18. Complete the participation form by thursday 10/13 @ 9:30am. Review session sunday 10/16 12-3 in 155 dwinelle. Sets have arbitrary order, just like dictionary entries. To add an element to a set, you can use the add method, which returns none, but changes the set. What we should be able to do with a set: Union: return a set with all elements in set1 or set2. Intersection: return a set with any elements in set1 and set2. Adjoin: return a set with all elements in s and a value. Di erent from add since it returns a new set, but doesn"t change the original set like the built-in add function in sets. Proposal 1: a set is represented by a linked list that contains no duplicate items.