(A) Texture
(B) Pixel intensity
(C) Threshold of intensity
(D) All of the given options
Author:
There is/are __ case/s for rotation in an AVL tree.
(A) 1
(B) 2
(C) 3
(D) 4
Which one is a self-referential data type?
(A) Stack
(B) Queue
(C) Link list
(D) All of the above
If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?
(A) data[0]
(B) data[n-1]
(C) data[n]
(D) data[2*n+1]
If a complete binary tree has height h then its number of nodes will be?
(A) Log (h)
(B) 2^(h+1)- 1
(C) Log (h) – 1
(D) 2^h – 1
If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use?
(A) Array
(B) List
(C) Both of the above
(D) None of the above
Void f(int i, int &k) {i = 1;k = 2; } Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y?
(A) Both x and y are still 0
(B) x is now 1, but y is still 0
(C) x is still 0, but y is now 2
(D) x is now 1, and y is now 2