Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q81
If the hashing function is the remainder on division, then clustering is more likely to occur if the storage space is divided into 40 sectors rather than 41. This conclusion is
Answer: Option B
Q82
The algorithm design technique used in the quick sort algorithm is
Answer: Option C
Q83
Linked lists are not suitable for
Answer: Option B
Q84
A 3-ary tree in which every internal node has exactly 3 children. the number of leaf nodes in such a tree with 6 internal nodes will be
Answer: Option D
Q85
In Pascal, each of the elements in the array var A :array [-6..6] of boolean can have
Answer: Option B
Q86
In C programming language, if the first and the second operands of operator + are of types int and float, respectively, the result will be of type
Answer: Option B
Q87
The minimum number of interchange needed to convert the array 89, 19, 14, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70, into a heap with maximum element at the root is
Answer: Option C
Q88
The minimum no. of colours needed to colour a graph of n(>3)
Answer: Option B
Q89
What is the maximum number of dimensions and array in C may have ?
Answer: Option D
Q90
C programming language provides operations which deal directly with objects such as
Answer: Option C