Dark Mode

Recent questions tagged gateit-2008

55 votes

3 answers

1

GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another 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$ ... . Which $IP$ address should $X$ configure its gateway as? $192.168.1.67$ $192.168.1.110$ $192.168.1.135$ $192.168.1.155$

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

15.6k views

53 votes

7 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 another 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$

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

9.0k views

17 votes

3 answers

3

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 implementations will produce the same output for $f(173)$ as the above code? ... { printf ("%d", n%2); f (n/2); } } Both $P1$ and $P2$ $P2$ only $P1$ only Neither $P1$ nor $P2$

Ishrat Jahan asked in Algorithms Oct 29, 2014

by Ishrat Jahan

7.4k views

14 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$

Ishrat Jahan asked in Algorithms Oct 29, 2014

by Ishrat Jahan

7.1k views

21 votes

4 answers

5

GATE IT 2008 | Question: 81
Consider a computer with a $4$-ways set-associative mapped cache of the following characteristics: a total of $1\;\text{MB}$ of main memory, a word size of $1\;\text{byte}$, a block size of $128$ ... $000011000$ $110001111$ $00011000$ $110010101$

Ishrat Jahan asked in CO and Architecture Oct 29, 2014

by Ishrat Jahan

4.7k views

16 votes

2 answers

6

GATE IT 2008 | Question: 80
Consider a computer with a $4$-ways set-associative mapped cache of the following characteristics: 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$

Ishrat Jahan asked in CO and Architecture Oct 29, 2014

by Ishrat Jahan

5.8k views

35 votes

1 answer

7

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 \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$

Ishrat Jahan asked in Compiler Design Oct 29, 2014

by Ishrat Jahan

6.9k views

37 votes

4 answers

8

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 \mid \epsilon$ Which of the following strings is generated by the grammar above? $aabbaba$ $aabaaba$ $abababb$ $aabbaab$

Ishrat Jahan asked in Compiler Design Oct 29, 2014

by Ishrat Jahan

7.1k views

55 votes

5 answers

9

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 respectively. 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 ... 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$

Ishrat Jahan asked in DS Oct 29, 2014

by Ishrat Jahan

11.3k views

40 votes

4 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 respectively. 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$

Ishrat Jahan asked in DS Oct 29, 2014

by Ishrat Jahan

13.7k views

45 votes

5 answers

11

GATE IT 2008 | Question: 75
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... schools with a pass percentage above $35\%$ over all exams taken together schools with a pass percentage above $35\%$ over each exam

Ishrat Jahan asked in Databases Oct 29, 2014

by Ishrat Jahan

11.0k views

48 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

Ishrat Jahan asked in Databases Oct 29, 2014

by Ishrat Jahan

14.8k views

29 votes

2 answers

13

GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$

Ishrat Jahan asked in DS Oct 29, 2014

by Ishrat Jahan

10.4k views

35 votes

3 answers

14

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, 472$ $142, 248, 520, 386, 345, 270, 307$ ... 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

Ishrat Jahan asked in DS Oct 29, 2014

by Ishrat Jahan

4.8k views

50 votes

4 answers

15

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, 472$ $142, 248, 520, 386, 345, 270, 307$ ... 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

Ishrat Jahan asked in DS Oct 29, 2014

by Ishrat Jahan

11.6k views

21 votes

4 answers

16

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: $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$

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

9.2k views

45 votes

3 answers

17

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 the server will not establish a connection $S2:$ Loss of $\text{ACK}$ from the client cannot establish ... on no packet loss $S2$ and $S3$ only $S1$ and $S4$ only $S1$ and $S3$ only $S2$ and $S4$ only

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

12.7k views

39 votes

2 answers

18

GATE IT 2008 | Question: 68
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

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

13.0k views

32 votes

4 answers

19

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 not LS routing (S2): In LS, the shortest path algorithm is run only at one node ( ... 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

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

7.5k views

37 votes

8 answers

20

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_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

11.9k views

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

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

6.7k views

74 votes

6 answers

22

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/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$

Ishrat Jahan asked in Computer Networks Oct 29, 2014

by Ishrat Jahan

19.9k views

37 votes

7 answers

23

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 transaction N on object O.] ... equivalent to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3

Ishrat Jahan asked in Databases Oct 29, 2014

by Ishrat Jahan

14.6k views

22 votes

5 answers

24

GATE IT 2008 | Question: 62
Let $R (A, B, C, D, E, P, G)$ be a relational schema in which the following functional dependencies 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 $\text{3NF}$, but not in $\text{BCNF}$ in $\text{2NF}$, but not in $\text{3NF}$ not in $\text{2NF}$

Ishrat Jahan asked in Databases Oct 29, 2014

by Ishrat Jahan

6.3k views

88 votes

3 answers

25

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, C), (B, D)$ gives a ... 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

Ishrat Jahan asked in Databases Oct 29, 2014

by Ishrat Jahan

30.4k views

4 votes

1 answer

26

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 data S2: The system must provide reasonable performance even under maximum load conditions S3: The software executable must ... interface windows must fit on a standard monitor's screen S4 and S3 S4 and S2 S3 and S1 S2 and S1

Ishrat Jahan asked in IS&Software Engineering Oct 29, 2014

by Ishrat Jahan

2.1k views

0 votes

2 answers

27

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 algorithms are to provide precisions of 10-3 and 10-6, respectively. She decides to ... from Low Precision Matrix. S4: One class should be derived from the other; the hierarchy is immaterial. S1 S2 S3 S4

Ishrat Jahan asked in IS&Software Engineering Oct 29, 2014

by Ishrat Jahan

1.2k views

0 votes

1 answer

28

GATE IT 2008 | Question: 58
A software project plan has identified ten tasks with each having dependencies as given in the following table: Task Depends On T1 - T2 T1 T3 T1 T4 T1 T5 T2 T6 T3 T7 T3, T4 T8 T4 T9 T5, T7, T8 T10 T6, T9 Answer the following questions: (Q1) What is the ... time unit and there is no restriction on the number of tasks that can be done in parallel ? 5, 5 4, 4 4, 5 5, 4

Ishrat Jahan asked in IS&Software Engineering Oct 29, 2014

by Ishrat Jahan

2.6k views

2 votes

1 answer

29

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 for the implementation (O3) User interactions (O4) External interfaces (O5) Number of programmers in the software project (O6) Files used by the system O2, O3 O1, O5 O4, O6 O2, O5

Ishrat Jahan asked in IS&Software Engineering Oct 29, 2014

by Ishrat Jahan

2.4k views

27 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}$

Ishrat Jahan asked in Operating System Oct 29, 2014

by Ishrat Jahan

6.3k views

Page:

1
2
3
next »

Recent questions tagged gateit-2008