Register

Recent questions tagged gateit-2004

26 votes
7 answers
63
GATE IT 2004 | Question: 28
In TCP, a unique sequence number is assigned to each byte word segment message
In TCP, a unique sequence number is assigned to eachbytewordsegmentmessage
User Avatar
21 votes
4 answers
65
GATE IT 2004 | Question: 26
A subnet has been assigned a subnet mask of $255.255.255.192$. What is the maximum number of hosts that can belong to this subnet? $14$ $30$ $62$ $126$
A subnet has been assigned a subnet mask of $255.255.255.192$. What is the maximum number of hosts that can belong to this subnet?$14$$30$$62$$126$
User Avatar
4 votes
2 answers
67
GATE IT 2004 | Question: 24
Which one of the following statements is FALSE? HTTP runs over TCP HTTP describes the structure of web pages HTTP allows information to be stored in a URL HTTP can be used to test the validity of a hypertext link
Which one of the following statements is FALSE?HTTP runs over TCPHTTP describes the structure of web pagesHTTP allows information to be stored in a URLHTTP can be used to...
User Avatar
24 votes
3 answers
68
GATE IT 2004 | Question: 23
Which one of the following statements is FALSE? TCP guarantees a minimum communication rate TCP ensures in-order delivery TCP reacts to congestion by reducing sender window size TCP employs retransmission to compensate for packet loss
Which one of the following statements is FALSE?TCP guarantees a minimum communication rateTCP ensures in-order deliveryTCP reacts to congestion by reducing sender window ...
User Avatar
34 votes
5 answers
70
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
User Avatar
0 votes
1 answer
73
GATE IT 2004 | Question: 18
The diagram that helps in understanding and representing user requirements for a software project using UML (Unified Modeling Language) is Entity Relationship Diagram Deployment Diagram Data Flow Diagram Use Case Diagram
The diagram that helps in understanding and representing user requirements for a software project using UML (Unified Modeling Language) isEntity Relationship DiagramDeplo...
User Avatar
2 votes
2 answers
75
GATE IT 2004 | Question: 16
Which of the following commands or sequences of commands will rename a file x to file y in a Unix system ? mv y, x mv x, y cp y, x (rm x) cp x, y (rm x) II and III II and IV I and III II only
Which of the following commands or sequences of commands will rename a file x to file y in a Unix system ?mv y, xmv x, ycp y, x (rm x)cp x, y (rm x)II and IIIII and IVI a...
User Avatar
29 votes
3 answers
76
GATE IT 2004 | Question: 15
Let $x$ be an integer which can take a value of $0$ or $1$. The statement if (x == 0) x = 1; else x = 0; is equivalent to which one of the following ? $x = 1 + x;$ $x = 1 - x;$ $x = x - 1;$ $x = 1\% x;$
Let $x$ be an integer which can take a value of $0$ or $1$. The statementif (x == 0) x = 1; else x = 0;is equivalent to which one of the following ?$x = 1 + x;$$x = 1 - ...
User Avatar
27 votes
4 answers
77
GATE IT 2004 | Question: 14
Which one of the following is NOT shared by the threads of the same process ? Stack Address Space File Descriptor Table Message Queue
Which one of the following is NOT shared by the threads of the same process ?StackAddress SpaceFile Descriptor TableMessage Queue
User Avatar
65 votes
9 answers
78
GATE IT 2004 | Question: 13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to del...
User Avatar
20 votes
2 answers
81
GATE IT 2004 | Question: 10
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier? $32 K \times 16$ bits $64 K \times 16$ bits $16 K \times 32$ bits $64 K \times 32$ bits
What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier?$32 K \times 16$ bits$64 K \times 16$ bits$16 K \times 32...
User Avatar
29 votes
5 answers
83
GATE IT 2004 | Question: 8
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate?$2$$4$$5$$6$
User Avatar
28 votes
5 answers
84
GATE IT 2004 | Question: 7
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$? $(a^* + b^* + c^*)^*$ $(a^*b^*c^*)^*$ $((ab)^* + c^*)^*$ $(a^*b^* + c^*)^*$
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$?$(a^* + b^* + c^*)^*$$(a^*b^*c^*)^*$$((ab)^* + c^*)^*$$(a^*b^* ...
User Avatar
25 votes
8 answers
86
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$
User Avatar
Page: