Exploring Comp139 Lecture 4
Let's dive into the details surrounding Comp139 Lecture 4.
- More unit tests for remove(). Fix add method to grow the array if it runs out of room. Generalize MemberList to store any object.
- Writing a chained (linked) list class.
- Fix a freeing bug in remove. Add toString. Make array expand if we run out of room.
- Following on from the previous
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
In-Depth Information on Comp139 Lecture 4
Converting specific list code to a list to hold any type of thing, then restricting it again with generics to only hold specific things (but ... Making a chain of items in the birthday game. Take the birthday game code/concept and make a "ChainedList" class to manage the chain. Use the same interface as our ... The birthday game. Chains of items as a storage mechanism.
Making a class to manage an array.
That wraps up our extensive overview of Comp139 Lecture 4.