Register

Recent questions tagged gateit-2008

0 0 votes
0 0 answers
6
6 views
GATE | IT | 2008 | Computer networks | Miscellaneous | Question 68
The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key crypto-systems, respectively are:A ...
User Avatar
100 100 votes
7 answers 7 answers
31.2k
31.2k views
GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ ad...
User Avatar
76 76 votes
10 answers 10 answers
23.1k
23.1k views
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresse...
User Avatar
23 23 votes
3 answers 3 answers
12.9k
12.9k views
GATE IT 2008 | Question: 83
Consider the code fragment written in C below : void f (int n) { if (n <= 1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } }Which of the following im...
User Avatar
21 21 votes
5 answers 5 answers
12.1k
12.1k views
GATE IT 2008 | Question: 82
Consider the code fragment written in C below :void f (int n) { if (n <=1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } }What does f(173) print?$010110101$...
User Avatar
44 44 votes
4 answers 4 answers
10.2k
10.2k views
GATE IT 2008 | Question: 81
Consider a computer with a $4$-ways set-associative mapped cache of the following character­istics: a total of $1\;\text{MB}$ of main memory, a word size of $1\;\text{byt...
User Avatar
30 30 votes
2 answers 2 answers
10.2k
10.2k views
GATE IT 2008 | Question: 80
Consider a computer with a $4$-ways set-associative mapped cache of the following character­istics: a total of $1 \ MB$ of main memory, a word size of $1$ byte, a block s...
User Avatar
54 54 votes
2 answers 2 answers
12.7k
12.7k views
GATE IT 2008 | Question: 79
$A$ CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and a and b are terminals.$S → aS \mid A$$A → aAb \mid bAa \mid \...
User Avatar
47 47 votes
7 answers 7 answers
14.0k
14.0k views
GATE IT 2008 | Question: 78
A CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and $a$ and $b$ are terminals.$S \to aS \mid A$$A \to aAb \mid bAa ...
User Avatar
96 96 votes
8 answers 8 answers
26.8k
26.8k views
GATE IT 2008 | Question: 77
A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respec­tively. The degree of a node is defined as the number of its neighbou...
User Avatar
70 70 votes
8 answers 8 answers
30.6k
30.6k views
GATE IT 2008 | Question: 76
A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respec­tively. The degree of a node is defined as the number of its neighbou...
User Avatar
70 70 votes
10 answers 10 answers
26.9k
26.9k views
GATE IT 2008 | Question: 75
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
User Avatar
68 68 votes
7 answers 7 answers
30.1k
30.1k views
GATE IT 2008 | Question: 74
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
User Avatar
39 39 votes
4 answers 4 answers
19.4k
19.4k views
GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys?$4$$5$$6$$9$
User Avatar
46 46 votes
3 answers 3 answers
11.2k
11.2k views
GATE IT 2008 | Question: 72
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys.$81, 537, 102, 439, 285, 376, 305$$52, 97, 121, 195, 242, 381...
User Avatar
78 78 votes
4 answers 4 answers
24.5k
24.5k views
GATE IT 2008 | Question: 71
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys.$81, 537, 102, 439, 285, 376, 305$$52, 97, 121, 195, 242, 381...
User Avatar
22 22 votes
4 answers 4 answers
14.6k
14.6k views
GATE IT 2008 | Question: 70
The total number of keys required for a set of $n$ individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are:$...
User Avatar
73 73 votes
7 answers 7 answers
24.9k
24.9k views
GATE IT 2008 | Question: 69
The three way handshake for $\text{TCP}$ connection establishment is shown below. Which of the following statements are TRUE?$S1:$ Loss of $\text{SYN} + \text{ACK}$ from...
User Avatar
61 61 votes
4 answers 4 answers
25.5k
25.5k views
GATE IT 2008 | Question: 68
Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...
User Avatar
50 50 votes
7 answers 7 answers
16.6k
16.6k views
GATE IT 2008 | Question: 67
Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?(S1): Count to infinity is a problem only with DV and...
User Avatar
65 65 votes
13 answers 13 answers
27.9k
27.9k views
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r...
User Avatar
43 43 votes
5 answers 5 answers
13.7k
13.7k views
GATE IT 2008 | Question: 65
The minimum frame size required for a CSMA/CD based computer network running at $1\text{Gbps}$ on a $200m$ cable with a link speed of $2 \times10^{8}\text{m/sec}$ is:$125...
User Avatar
115 115 votes
9 answers 9 answers
41.9k
41.9k views
GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...
User Avatar
66 66 votes
10 answers 10 answers
28.1k
28.1k views
GATE IT 2008 | Question: 63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by trans...
User Avatar
41 41 votes
8 answers 8 answers
15.6k
15.6k views
GATE IT 2008 | Question: 62
Let $R (A, B, C, D, E, P, G)$ be a relational schema in which the following functional depen­dencies are known to hold: $AB \to CD, DE \to P, C \to E, P \to C$ and $B \to...
User Avatar
140 140 votes
6 answers 6 answers
51.8k
51.8k views
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies :$A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, ...
User Avatar
4 4 votes
1 answers 1 answer
3.6k
3.6k views
GATE IT 2008 | Question: 60
Which of the following requirement specifications can be validated?S1: If the system fails during any operation, there should not be any loss of dataS2: The system must ...
User Avatar
0 0 votes
2 2 answers
2.6k
2.6k views
GATE IT 2008 | Question: 59
A software engineer is required to implement two sets of algorithms for a single set of matrix operations in an object oriented programming language; the two sets of algo...
User Avatar
0 0 votes
1 answers 1 answer
4.5k
4.5k views
GATE IT 2008 | Question: 58
A software project plan has identified ten tasks with each having dependencies as given in the following table:TaskDepends OnT1-T2T1T3T1T4T1T5T2T6T3T7T3, T4T8T4T9T5, T7, ...
User Avatar
2 2 votes
1 answers 1 answer
3.6k
3.6k views
GATE IT 2008 | Question: 57
Which of the following are NOT considered when computing function points for a software project?(O1) External inputs and outputs(O2) Programming language to be used f...
User Avatar
Page: