Which one of the below 4-way B-Tree results from the insertion of the following keys: 5,15,60,70,80,30,40,50,10,20,35. Assume a right-bias partition.

What will the resulting heap be after a deletion on the following heap?

Using the Disjoint Set Algorithm, the current sets are shown in the below figure.  If the concept of Ranked Union is used, what will be the correct output of the Union ('2','1') instruction?

You are inserting keys in a hash that uses quadratic probing as a way to handle collisions.   The hash table has 9 slots and the has function is h(k) = k mod 9 and the probing function is f(i) = i² where i = 0,1,2,3,4,...

h'(k) =

Keys to be inserted: 5,28,19,15,20,33,12,17,35

Using the above information, what will be the key inserted on slot 0 (Assume a zero-based array).

Using the following valid Red Black Tree.  Which rule is applied when deleting the node with Key '0009'?

Using the following valid  Adelson-Velsky-Landis Tree.  Which key from the below options is a valid replacement after the node with key '0024' is deleted?