GATE 1999 Computer Science questions and solutions

Recent questions tagged gate1999

22 votes
2 answers
31
41 votes
6 answers
32
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
28 votes
2 answers
33
A grammar that is both left and right recursive for a non-terminal, isAmbiguousUnambiguousInformation is not sufficient to decide whether it is ambiguous or unambiguousNo...
5 votes
4 answers
34
The number of tokens in the FORTRAN statement DO 10 I = 1.25 is345None of the above
36 votes
3 answers
38
32 votes
3 answers
40
Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state?$A=0, B=0, C=1$$A=0, B...
53 votes
3 answers
42
29 votes
2 answers
44
38 votes
7 answers
46
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
25 votes
1 answer
49
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
29 votes
3 answers
52
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is$O(n^2)$$O(n)$$O(\log n)$$O(1)$
29 votes
4 answers
53
38 votes
1 answer
55
21 votes
6 answers
56
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
30 votes
5 answers
57
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is$\log_2 n$$\sqrt n$$n-1$$n$
39 votes
5 answers
58
48 votes
2 answers
59
57 votes
6 answers
60
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the w...