Register
Filter

Recent questions

20 votes
1 answer
58922
GATE CSE 2002 | Question: 6
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
User Avatar
28 votes
5 answers
58923
GATE CSE 2002 | Question: 5a
Obtain the eigen values of the matrix$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$
Obtain the eigen values of the matrix$$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$$
User Avatar
55 votes
6 answers
58926
GATE CSE 2002 | Question: 2.25
From the following instance of a relation schema $R(A,B,C)$ ... functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:$$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \textbf{C} \\\hline \text{1} & \...
User Avatar
28 votes
4 answers
58931
GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...
User Avatar
28 votes
6 answers
58932
GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...
User Avatar
35 votes
3 answers
58933
GATE CSE 2002 | Question: 2.18
The C language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
The C language is:A context free languageA context sensitive languageA regular languageParsable fully only by a Turing machine
User Avatar
31 votes
6 answers
58934
GATE CSE 2002 | Question: 2.17
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetric Symmetric and reflexive Transitive and reflexive Transitive and symmetric
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetricSymmetric and reflexiveTransitive and reflexive...
User Avatar
22 votes
5 answers
58935
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is$\frac{1}{16}$$\frac{1}{8}$$\frac{7}{8}$$\frac{15}{16}$
User Avatar
0 votes
1 answer
58936
GATE CSE 2002 | Question: 2.15
The Newton-Raphson iteration $X_{n+1} = (\frac{X_n}{2}) + \frac{3}{(2X_n)}$ can be used to solve the equation $X^2 =3$ $X^3 =3$ $X^2 =2$ $X^3 =2$
The Newton-Raphson iteration $X_{n+1} = (\frac{X_n}{2}) + \frac{3}{(2X_n)}$ can be used to solve the equation$X^2 =3$$X^3 =3$$X^2 =2$$X^3 =2$
User Avatar
26 votes
3 answers
58938
GATE CSE 2002 | Question: 2.13
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has $2$ states $3$ states $4$ states $5$ states
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has$2$ states$3$ states$4$ states$5$ states
User Avatar
47 votes
7 answers
58940
GATE CSE 2002 | Question: 2.11
The running time of the following algorithm Procedure $A(n)$ If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$; is best described by $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
The running time of the following algorithmProcedure $A(n)$If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$;is best described by$O(n)$$O(\log ...
User Avatar
Page: