Recent questions tagged gate1996

21 votes
1 answer
35
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
38
55 votes
8 answers
39
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
40
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
41
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
44
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
45
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...
24 votes
2 answers
54
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is$101010\ldots1010$$100000\ldots 0001$$111111\ldots 1111$$011111\ldots...
3 votes
2 answers
55
33 votes
2 answers
56
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
23 votes
1 answer
58
26 votes
1 answer
59