Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays
below, determine the one that cannot possibly be a heap:
Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first
partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?
Consider the following paragraph with blanks.
A …….…….. is a linear list where …………… and ………… take place at the
same end . This end is called the …….……….
What would be the correct filling the above blank positions?
Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ?
Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains
the maximum element. What is the result of deleting 40 from this heap
