Register

Recent questions tagged gateit-2008

54 votes
8 answers
2
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 addresses $192.168.1.135$ and $192.168.1.110$. $R2$ ... $1$ $2$ $3$ $6$
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 address...
User Avatar
15 votes
4 answers
4
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$ $010101101$ $10110101$ $10101101$
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
42 votes
5 answers
10
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 neighbours. $n_3$ can be expressed as $n_1 + n_2 - 1$ $n_1 -2$ $[((n_1 + n_2)/2)]$ $n_2 - 1$
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 neighbo...
User Avatar
52 votes
5 answers
12
GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error
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
32 votes
2 answers
13
GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$
How many distinct BSTs can be constructed with $3$ distinct keys?$4$$5$$6$$9$
User Avatar
28 votes
3 answers
21
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 \text{bytes}$ $250 \text{bytes}$ $500 \text{bytes}$ None of the above
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
30 votes
2 answers
30
GATE IT 2008 | Question: 56
Match the following flag bits used in the context of virtual memory management on the left side with the different purposes on the right side of the table below. ... $\text{I-c, II-d, III-a, IV-b}$ $\text{I-b, II-c, III-d, IV-a}$
Match the following flag bits used in the context of virtual memory management on the left side with the different purposes on the right side of the table below.$$\small ...
User Avatar
Page: