GATE Information Technology (IT) paper 2008 questions

# Recent questions tagged gate2008-it

1
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$ has $IP$ addresses $192.168.1.67$ ... $IP$ address should $X$ configure its gateway as? $192.168.1.67$ $192.168.1.110$ $192.168.1.135$ $192.168.1.155$
2
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$ has IP addresses $192.168.1.67$ and ... is $255.255.255.224$. Given the information above, how many distinct subnets are guaranteed to already exist in the network? $1$ $2$ $3$ $6$
3
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 implementations will produce the same output for $f(173)$ as the above code? P1 P2 void f (int n) { if (n/2) { f(n/2 ... ("%d", n); } else { printf ("%d", n%2); f (n/2); } } Both $P1$ and $P2$ $P2$ only $P1$ only Neither $P1$ nor $P2$
4
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$
5
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 size of $128$ words and a cache size of $8$ $KB$. While accessing the memory location $0C795H$ by the CPU, the contents of the TAG field of the corresponding cache line is: $000011000$ $110001111$ $00011000$ $110010101$
6
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 size of $128$ words and a cache size of $8 \ KB$. The number of bits in the TAG, SET and WORD fields, respectively are: $7, 6, 7$ $8, 5, 7$ $8, 6, 6$ $9, 4, 7$
7
$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 \epsilon$ For the string "$aabbaab$" how many steps are required to derive the string and how many parse trees are there? $6$ and $1$ $6$ and $2$ $7$ and $2$ $4$ and $2$
8
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 \mid \epsilon$ Which of the following strings is generated by the grammar above? $aabbaba$ $aabaaba$ $abababb$ $aabbaab$
9
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. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add an edge between the two ... edges will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$
10
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$
11
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ $\text{School} (\underline{\text{school-id}}, \text{sch-name}, \text{sch-address}, \text{sch-phone})$ ... the other schools with a pass percentage above $35\%$ over all exams taken together schools with a pass percentage above $35\%$ over each exam
12
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ $\text{School} (\underline{\text{school-id}}, \text{sch-name}, \text{sch-address}, \text{sch-phone})$ ... in it, 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
13
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$
14
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, 472$ $142, 248, 520, 386, 345, 270, 307$ $550, 149, 507, 395, 463, 402, 270$ ... II is an inorder sequence of some BST where $121$ is the root and $52$ is a leaf IV is a postorder sequence of some BST with $149$ as the root
15
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, 472$ $142, 248, 520, 386, 345, 270, 307$ ... the above sequences list nodes in the order in which we could have encountered them in the search? II and III only I and III only III and IV only III only
16
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: $n(n-1)$ and $2n$ $2n$ and $\dfrac{n(n - 1)}{2}$ $\dfrac{n(n - 1)}{2}$ and $2n$ $\dfrac{n(n - 1)}{2}$ and $n$
17
The three way handshake for TCP connection establishment is shown below. Which of the following statements are TRUE? $S1:$ Loss of $SYN + ACK$ from the server will not establish a connection $S2:$ Loss of $ACK$ from the client cannot establish the connection $S3:$ ... machine on no packet loss $S2$ and $S3$ only $S1$ and $S4$ only $S1$ and $S3$ only $S2$ and $S4$ only
18
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only
19
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 not LS routing (S2): In LS, the shortest path algorithm is run only at one node (S3): In DV, the ... ): DV requires lesser number of network messages than LS S1, S2 and S4 only S1, S3 and S4 only S2 and S3 only S1 and S4 only
20
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_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ of parity bits ... shows data received by a receiver and has $n$ corrupted bits. What is the mini­mum possible value of $n$? $1$ $2$ $3$ $4$
21
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
22
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 108 m/s. What should be the packet size for a channel utilization of $25$\text{%}$for a satellite link using go-back-$ ... there are no errors during communication. $120$ $\text{bytes}$ $60$ $\text{bytes}$ $240$ $\text{bytes}$ $90$ $\text{bytes}$
23
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 transaction N on object O.] ... S3 are conflict equivalent to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
24
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 G.$ The relational schema $R$ is in $\text{BCNF}$ in $3NF$, but not in $\text{BCNF}$ in $2NF$, but not in $3NF$ not in $2NF$
25
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, C), (B, D)$ gives a lossless join, and is ... gives a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
26
Which of the following requirement specifications can be validated? S1: If the system fails during any operation, there should not be any loss of data S2: The system must provide reasonable performance even under maximum load conditions S3: The software executable must be deployable under ... : User interface windows must fit on a standard monitor's screen S4 and S3 S4 and S2 S3 and S1 S2 and S1
27
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­rithms are to provide precisions of 10-3 and 10-6, respectively. She decides to implement two classes ... derived from Low Precision Matrix. S4: One class should be derived from the other; the hierarchy is immaterial. S1 S2 S3 S4
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}$