In this chapter we have presented open hashing, where all items that hash to the same position are stored in a bucket that is represented by a linked list. With closed hashing, whenever an item is hashed to a position that is already occupied, search for some other place in the table to put it; so all buckets have ≤ 1 element, and items (or pointers to them) are stored directly in the table.
A. Present pseudo-code for the basic MEMBER, INSERT, and DELETE operations with linear probing, where you simply scan from that position forward (wrapping around if you get to the end of the table) until an empty position is found.
B. Generalize Part A to quadratic probing where you scan forward by quadratic amounts (in the hope of avoiding bunching up of entries).