6. Let h(k) be the CRC hash function with b = 4 and q = 23....

 

Transcribed Image Text:

6. Let h(k) be the CRC hash function with b = 4 and q = 23. Compute the value of h(231). 7. Consider the universal hashing scheme with table size m = 5. Suppose that r = 3. (This means that all keys can be represented with 4 digits in 5-ary notation, so all keys are in the range 0, 1, ..., 624.) Compute ha (207) for a = (3, 1, 5,2). 8. Define binary search trees. How the operations of find(), insert() and delete() are imple- mented on binary search trees? (Only a brief explanation in English, no pseud-ocode). 6. Let h(k) be the CRC hash function with b = 4 and q = 23. Compute the value of h(231). 7. Consider the universal hashing scheme with table size m = 5. Suppose that r = 3. (This means that all keys can be represented with 4 digits in 5-ary notation, so all keys are in the range 0, 1, ..., 624.) Compute ha (207) for a = (3, 1, 5,2). 8. Define binary search trees. How the operations of find(), insert() and delete() are imple- mented on binary search trees? (Only a brief explanation in English, no pseud-ocode).