Register

Recent questions tagged gateit-2005

73 votes
8 answers
61
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...
User Avatar
15 votes
3 answers
64
GATE IT 2005 | Question: 29
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control
Count to infinity is a problem associated with:link state routing protocol.distance vector routing protocolDNS while resolving host nameTCP for congestion control
User Avatar
31 votes
6 answers
65
GATE IT 2005 | Question: 28
Which of the following statements is FALSE regarding a bridge? Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more LAN segments Bridge reduces broadcast domain
Which of the following statements is FALSE regarding a bridge?Bridge is a layer $2$ deviceBridge reduces collision domainBridge is used to connect two or more LAN segment...
User Avatar
66 votes
8 answers
70
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
User Avatar
28 votes
5 answers
71
GATE IT 2005 | Question: 22
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$ In terms of Normalization, this table is in $1\;\text{NF}$ $2\;\text{NF}$ $3\;\text{NF}$ None of these
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$In terms of Normalization, this ...
User Avatar
65 votes
12 answers
79
GATE IT 2005 | Question: 14
In a depth-first traversal of a graph $G$ with $n$ vertices, $k$ edges are marked as tree edges. The number of connected components in $G$ is $k$ $k+1$ $n-k-1$ $n-k$
In a depth-first traversal of a graph $G$ with $n$ vertices, $k$ edges are marked as tree edges. The number of connected components in $G$ is$k$$k+1$$n-k-1$$n-k$
User Avatar
53 votes
7 answers
81
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
User Avatar
28 votes
3 answers
82
GATE IT 2005 | Question: 11
How many pulses are needed to change the contents of a $8$-bit up counter from $10101100$ to $00100111$ (rightmost bit is the LSB)? $134$ $133$ $124$ $123$
How many pulses are needed to change the contents of a $8$-bit up counter from $10101100$ to $00100111$ (rightmost bit is the LSB)?$134$$133$$124$$123$
User Avatar
37 votes
4 answers
84
GATE IT 2005 | Question: 9
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of t...
User Avatar
22 votes
3 answers
85
GATE IT 2005 | Question: 8
Using Booth's Algorithm for multiplication, the multiplier $-57$ will be recoded as $0$ -$1$ $0$0$ $1$ $0$ $0$ -$1$ $1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$ $0$ -$1$ $0$ $0$ $1$0$ $0$ $0$ $0$ $1$ $0$ $0$ -$1$ $0$ $0$ $1$
Using Booth's Algorithm for multiplication, the multiplier $-57$ will be recoded as$0$ -$1$ $0$$0$ $1$ $0$ $0$ -$1$$1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$$0$ -$1$ $0$ $0$ $1$$0$ ...
User Avatar
42 votes
4 answers
86
GATE IT 2005 | Question: 7
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$ $(A + B + C) (\bar A +\bar B +\bar C)$ $(A + B + C) (\bar A +\bar B + C)$ $ABC + \bar A (B \oplus C) + \bar B(A \oplus C)$ None of these
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$$(A + B + C) (\bar A +\bar B +\bar C)$$(A + B + C) (\bar A +\bar B + C)$$ABC + \bar A (B \oplus...
User Avatar
23 votes
1 answer
87
GATE IT 2005 | Question: 6
The language $\{0^n 1^n 2^n \mid 1 \leq n \leq 10^6\}$ is regular context-free but not regular context-free but its complement is not context-free not context-free
The language $\{0^n 1^n 2^n \mid 1 \leq n \leq 10^6\}$ isregularcontext-free but not regularcontext-free but its complement is not context-freenot context-free
User Avatar
29 votes
8 answers
90
GATE IT 2005 | Question: 3
The determinant of the matrix given below is $\begin{bmatrix} 0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1 \end{bmatrix}$ $-1$ $0$ $1$ $2$
The determinant of the matrix given below is$$\begin{bmatrix}0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1\end{bmatrix}$$$-1$$0$$1$$2$
User Avatar
Page: