3

8) Consider an extendable hashing scheme with a hash function that generates 16-bit hash values. The hash values for the search keys to be inserted are generated as shown in 8. Let the maximum number of records that can be accommodated in a disk block be 2 . Determine the length of hash prefix for the given scheme. 9) Consider the given instance of a 2-3-4 tree and answer the question that follows. 2 points If we perform the following operations (in the given order) in the instance given in Figure 2, then how many data elements are there in the leaf nodes of the resultant 2-3-4 tree? - Insert value 38 - Insert value 89 - Insert value 100 6 8 7 9 10) Consider the B + tree given in Figure 4. 3 points Let n1 be the minimum number of nodes (including the root node) that should be accessed in order to fetch all records with a search key greater than or equal to 1 and less than or equal to 55. Let n2 be the minimum number of nodes (including the root node) that should be accessed in order to fetch all records with a search key greater than or equal to 5 and less than 34 . What will be the value of n1+n2 ? 11 12 9 15 8) Consider an extendable hashing scheme with a hash function that generates 16-bit hash values. The hash values for the search keys to be inserted are generated as shown in 8. Let the maximum number of records that can be accommodated in a disk block be 2 . Determine the length of hash prefix for the given scheme. 9) Consider the given instance of a 2-3-4 tree and answer the question that follows. 2 points If we perform the following operations (in the given order) in the instance given in Figure 2, then how many data elements are there in the leaf nodes of the resultant 2-3-4 tree? - Insert value 38 - Insert value 89 - Insert value 100 6 8 7 9 10) Consider the B + tree given in Figure 4. 3 points Let n1 be the minimum number of nodes (including the root node) that should be accessed in order to fetch all records with a search key greater than or equal to 1 and less than or equal to 55. Let n2 be the minimum number of nodes (including the root node) that should be accessed in order to fetch all records with a search key greater than or equal to 5 and less than 34 . What will be the value of n1+n2 ? 11 12 9 15