21 votes
1 answer
34
The correct matching for the following pairs is$$\begin{array}{ll|ll} \text{(A)}&\text{Activation record} & \text{(1)} &\text{Linking loader} \\ \text{(B)} &\text{Locati...
26 votes
5 answers
37
A binary search tree is generated by inserting in order the following integers:$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$The number of nodes in the left subtree and ...
55 votes
8 answers
38
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
23 votes
4 answers
39
The recurrence relation$T(1) = 2$$T(n) = 3T (\frac{n}{4}) +n$has the solution $T(n)$ equal to$O(n)$$O (\log n)$$O\left(n^\frac{3}{4}\right)$ None of the above
28 votes
3 answers
40
The minimum number of interchanges needed to convert the array into a max-heap is$89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$$0$$1$$2$$3$
23 votes
6 answers
43
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one?$L_1.L_2$$L_1 \cap L...
23 votes
4 answers
44
The probability that top and bottom cards of a randomly shuffled deck are both aces is$\frac{4}{52} \times \frac{4}{52}$$\frac{4}{52} \times \frac{3}{52}$$\frac{4}{52} \t...
18 votes
4 answers
45
4 votes
2 answers
46