Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gateit-2004
2
votes
0
answers
1
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47 And this question: https://gateoverflow.in/1314/gate2009-28 Both questions are somewhat similar. In the first one's answer, instruction $I_1$ (when i = ... I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47And this question: https://gateoverflow.in/1314/gate2009-28Both questions are s...
Rishabh Gupta 2
1.5k
views
Rishabh Gupta 2
asked
Nov 4, 2017
CO and Architecture
co-and-architecture
pipelining
gateit-2004
gatecse-2009
+
–
3
votes
1
answer
2
GATE IT 2004 | Question: 90
Given below are several usages of the anchor tag in HTML. <A HREF = "http://www.gate.ac.in/HTML/BASIC/testpage.html">Test Me</A> <A HREF = "/BASIC/testpage.html">Test Me</A> <A HREF = "testpage.html">Test ... A> Which of the above are valid? I and II only I and III only I, II and III only I, II, III and IV
Given below are several usages of the anchor tag in HTML.<A HREF = "http://www.gate.ac.in/HTML/BASIC/testpage.html">Test Me</A><A HREF = "/BASIC/testpage.html">Test Me</A...
Ishrat Jahan
3.3k
views
Ishrat Jahan
asked
Nov 2, 2014
Web Technologies
gateit-2004
web-technologies
html
normal
out-of-gate-syllabus
non-gate
+
–
1
votes
1
answer
3
GATE IT 2004 | Question: 89
Consider an XML file called intro.xml and a document type defintion (DTD) file intro.dtd as follows: intro.xml <?xml version = "1.0"?> <!DOCTYPE myMessage SYSTEM "intro.dtd" <myMessage> <message> ... intro.xml as Well-formed and validated Well-formed but not validated Validated but not well-formed Neither validated nor well-formed
Consider an XML file called intro.xml and a document type defintion (DTD) file intro.dtd as follows:intro.xml<?xml version = "1.0"? <!DOCTYPE myMessage SYSTEM "intro.dtd"...
Ishrat Jahan
2.0k
views
Ishrat Jahan
asked
Nov 2, 2014
Web Technologies
gateit-2004
web-technologies
xml
non-gate
normal
+
–
61
votes
10
answers
4
GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...
Ishrat Jahan
23.6k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
51
votes
6
answers
5
GATE IT 2004 | Question: 87
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame and the second network can carry a maximum payload of $400$ $bytes$ per frame, excluding ... second network for this transmission? $\text{40 bytes}$ $\text{80 bytes}$ $\text{120 bytes}$ $\text{160 bytes}$
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
Ishrat Jahan
19.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
24
votes
6
answers
6
GATE IT 2004 | Question: 86
In the TCP/IP protocol suite, which one of the following is NOT part of the IP header? Fragment Offset Source IP address Destination IP address Destination port number
In the TCP/IP protocol suite, which one of the following is NOT part of the IP header?Fragment OffsetSource IP addressDestination IP addressDestination port number
Ishrat Jahan
6.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
ip-packet
normal
+
–
67
votes
6
answers
7
GATE IT 2004 | Question: 85
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the same slot, then ... if each host has to be provided a minimum throughput of $0.16$ frames per time slot? $1$ $2$ $3$ $4$
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and...
Ishrat Jahan
16.6k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
congestion-control
mac-protocol
normal
+
–
47
votes
7
answers
8
GATE IT 2004 | Question: 84
Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are also code words? $0010111$ $0110110$ $1011010$ $0111010$ I and III I, II and III II and IV I, II, III and IV
Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are als...
Ishrat Jahan
18.6k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
30
votes
5
answers
9
GATE IT 2004 | Question: 83
A $20$ $\text{Kbps}$ satellite link has a propagation delay of $400$ $\text{ms}$. The transmitter employs the "go back $n$ $ARQ$" scheme with $n$ set to $10$. Assuming that each frame is $100$ $\text{byte}$ long, what is the maximum data rate possible? $5$ $\text{Kbps}$ $10$ $\text{Kbps}$ $15$ $\text{Kbps}$ $20$ $\text{Kbps}$
A $20$ $\text{Kbps}$ satellite link has a propagation delay of $400$ $\text{ms}$. The transmitter employs the "go back $n$ $ARQ$" scheme with $n$ set to $10$. Assuming th...
Ishrat Jahan
10.9k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
5
votes
4
answers
10
GATE IT 2004 | Question: 82
Consider a 10 Mbps token ring LAN with a ring latency of 400 µs. A host that needs to transmit seizes the token. Then it sends a frame of 1000 bytes, removes the frame after it has circulated all around the ring, and finally releases the token. ... every frame. Assuming that only a single host wishes to transmit, the effective data rate is 1 Mbps 2 Mbps 5 Mbps 6 Mbps
Consider a 10 Mbps token ring LAN with a ring latency of 400 µs. A host that needs to transmit seizes the token. Then it sends a frame of 1000 bytes, removes the frame a...
Ishrat Jahan
7.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
lan-technologies
token-ring
normal
out-of-syllabus-now
+
–
30
votes
5
answers
11
GATE IT 2004 | Question: 81
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $\min (M, N)$ $\max (M, N)$ $M + N$ $MN$
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ...
Ishrat Jahan
10.4k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
26
votes
3
answers
12
GATE IT 2004 | Question: 80
In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as $01101011$ $011010110$ $011101100$ $0110101100$
In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as$011010...
Ishrat Jahan
9.9k
views
Ishrat Jahan
asked
Nov 2, 2014
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
34
votes
2
answers
13
GATE IT 2004 | Question: 79
Consider a table $T$ in a relational database with a key field $K$. A $B$-tree of order $p$ is used as an access structure on $K$, where $p$ denotes the maximum number of tree pointers in a B-tree index node. Assume that $K$ is $10$ $bytes$ long; disk block ... In order for each $B$-tree node to fit in a single disk block, the maximum value of $p$ is $20$ $22$ $23$ $32$
Consider a table $T$ in a relational database with a key field $K$. A $B$-tree of order $p$ is used as an access structure on $K$, where $p$ denotes the maximum number of...
Ishrat Jahan
7.6k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
b-tree
normal
+
–
38
votes
3
answers
14
GATE IT 2004 | Question: 78
Consider two tables in a relational database with columns and rows as follows: ... 1 Both i and ii will fail i will fail but ii will succeed i will succeed but ii will fail Both i and ii will succeed
Consider two tables in a relational database with columns and rows as follows:$$\overset{\text{Table: Student}}{\begin{array}{|c|c|c|} \hline \textbf {Roll_no} & \textbf{...
Ishrat Jahan
10.9k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
sql
normal
+
–
43
votes
6
answers
15
GATE IT 2004 | Question: 77
Consider the following schedule $S$ of transactions $T1$ and $T2:$ ... only as $T2, T1$ $S$ is serializable both as $T1, T2$ and $T2, T1$ $S$ is not serializable either as $T1,T2$ or as $T2,T1$
Consider the following schedule $S$ of transactions $T1$ and $T2:$$${\begin{array}{l|l}\textbf{T1}& \textbf{T2} \\\hline\text{Read(A)} \\\text{A = A – 10}\\& \text...
Ishrat Jahan
12.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
transaction-and-concurrency
normal
+
–
43
votes
5
answers
16
GATE IT 2004 | Question: 76
A table T1 in a relational database has the following rows and columns: ... set marks = marks + 5 Select avg(marks) from T1 What is the output of the select statement? $18.75$ $20$ $25$ $\text{Null}$
A table T1 in a relational database has the following rows and columns: $$\begin{array}{|c|c|c|} \hline \text {Roll no. } & \text {Marks} \\\hline 1& 10 \\\hline 2 & 20 ...
Ishrat Jahan
10.5k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
sql
normal
+
–
58
votes
6
answers
17
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...
Ishrat Jahan
17.5k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
database-normalization
normal
+
–
41
votes
5
answers
18
GATE IT 2004 | Question: 74
A relational database contains two tables student and department in which student table has columns roll_no, name and dept_id and department table has columns dept_id and dept_name. The following insert statements were executed successfully to populate the empty tables: ... department 0 row and 4 columns 3 rows and 4 columns 3 rows and 5 columns 6 rows and 5 columns
A relational database contains two tables student and department in which student table has columns roll_no, name and dept_id and department table has columns dept_id and...
Ishrat Jahan
12.2k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
sql
normal
+
–
59
votes
5
answers
19
GATE IT 2004 | Question: 73
Consider the following entity relationship diagram $(ERD)$, where two entities $E1$ and $E2$ have a relation $R$ of cardinality 1:m. The attributes of $E1$ are $A11$, $A12$ and $A13$ where $A11$ is the key attribute. The attributes of $E2$ are $A21$ ... normal form ($3NF$) is designed from the above $ERD$. The number of tables in the database is $2$ $3$ $5$ $4$
Consider the following entity relationship diagram $(ERD)$, where two entities $E1$ and $E2$ have a relation $R$ of cardinality 1:m.The attributes of $E1$ are $A11$, $A12...
Ishrat Jahan
18.7k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
er-diagram
normal
+
–
3
votes
1
answer
20
GATE IT 2004 | Question: 72
What is the availability of a software with the following reliability figures? Mean Time Between Failure (MTBF) = 25 days Mean Time To Repair (MTTR) = 6 hours 1% 24% 99% 99.009%
What is the availability of a software with the following reliability figures?Mean Time Between Failure (MTBF) = 25 daysMean Time To Repair (MTTR) = 6 hours1%24%99%99.009...
Ishrat Jahan
5.1k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
software-reliability
normal
+
–
4
votes
2
answers
21
GATE IT 2004 | Question: 71
A software was tested using the error seeding strategy in which 20 errors were seeded in the code. When the code was tested using the complete test suite, 16 of the seeded errors were detected. The same test suite also detected 200 non-seeded errors. What is the estimated number of undetected errors in the code after this testing? 4 50 200 250
A software was tested using the error seeding strategy in which 20 errors were seeded in the code. When the code was tested using the complete test suite, 16 of the seede...
Ishrat Jahan
3.8k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
error-detection
normal
+
–
3
votes
2
answers
22
GATE IT 2004 | Question: 70
Assume that the delivered lines of code L of a software is related to the effort E in person months and duration t in calendar months by the relation L P* (E/B)1/3 * t4/3, where P and B are two constants for the software process and ... asked the project team to complete the software project in 4 months. What would be the required effort in person months? 10 40 160 320
Assume that the delivered lines of code L of a software is related to the effort E in person months and duration t in calendar months by the relation L P* (E/B)1/3 * t4/3...
Ishrat Jahan
3.1k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
software-effort
normal
+
–
3
votes
1
answer
23
GATE IT 2004 | Question: 69
Consider the following program module: int module1 (int x, int y) { while (x! = y) { if (x > y) x = x - y, else y = y - x; } return x; } What is Cyclomatic complexity of the above module? 1 2 3 4
Consider the following program module:int module1 (int x, int y) { while (x! = y) { if (x y) x = x - y, else y = y - x; } return x; }What is Cyclomatic complexity of the...
Ishrat Jahan
3.8k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
cyclomatic-complexity
normal
+
–
3
votes
2
answers
24
GATE IT 2004 | Question: 68
A software project involves execution of 5 tasks T1, T2, T3, T4 and T5 of duration 10, 15, 18, 30 and 40 days, respectively. T2 and T4 can start only after T1 completes. T3 can start after T2 completes. T5 can start only after both T3 and T4 complete. What is the slack time of the task T3 in days? 0 3 18 30
A software project involves execution of 5 tasks T1, T2, T3, T4 and T5 of duration 10, 15, 18, 30 and 40 days, respectively. T2 and T4 can start only after T1 completes. ...
Ishrat Jahan
7.9k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
software-time-estimation
normal
+
–
31
votes
5
answers
25
GATE IT 2004 | Question: 67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect b...
Ishrat Jahan
9.1k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
file-system
normal
+
–
26
votes
1
answer
26
GATE IT 2004 | Question: 66
In a virtual memory system, size of the virtual address is $32$-bit, size of the physical address is $30$-bit, page size is $4$ Kbyte and size of each page table entry is $32$-bit. The main memory is byte addressable. Which one of the following ... number of bits that can be used for storing protection and other information in each page table entry? $2$ $10$ $12$ $14$
In a virtual memory system, size of the virtual address is $32$-bit, size of the physical address is $30$-bit, page size is $4$ Kbyte and size of each page table entry is...
Ishrat Jahan
10.9k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
virtual-memory
normal
+
–
30
votes
6
answers
27
GATE IT 2004 | Question: 65
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, and process P2 repeatedly removes one item at a time from the same buffer using the programs given below. In ... P(empty), V(full) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty)
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, an...
Ishrat Jahan
7.0k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
process-synchronization
normal
+
–
41
votes
6
answers
28
GATE IT 2004 | Question: 64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n - 1$ $3^n - 1$
A process executes the following segment of code :for(i = 1; i <= n; i++) fork ();The number of new processes created is$n$$((n(n + 1))/2)$$2^n - 1$$3^n - 1$
Ishrat Jahan
11.8k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
fork-system-call
easy
+
–
52
votes
6
answers
29
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
Ishrat Jahan
13.3k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
28
votes
4
answers
30
GATE IT 2004 | Question: 62
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$ ... Time First) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...
Ishrat Jahan
10.2k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
disk-scheduling
normal
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register