Recent questions tagged gateit-2004

2 2 votes
0 0 answers
2.5k
2.5k views
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...
3 3 votes
1 answers 1 answer
3.9k
3.9k views
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...
1 1 vote
1 1 answer
2.7k
2.7k views
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"...
87 87 votes
15 answers 15 answers
42.0k
42.0k views
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...
70 70 votes
8 answers 8 answers
36.8k
36.8k views
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...
32 32 votes
8 answers 8 answers
10.3k
10.3k views
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
94 94 votes
9 answers 9 answers
30.5k
30.5k views
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...
49 49 votes
8 answers 8 answers
29.6k
29.6k views
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...
46 46 votes
7 answers 7 answers
20.9k
20.9k views
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...
5 5 votes
4 answers 4 answers
11.1k
11.1k views
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 af...
46 46 votes
6 answers 6 answers
19.1k
19.1k views
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 ...
62 62 votes
4 answers 4 answers
20.8k
20.8k views
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:$01101...
50 50 votes
2 answers 2 answers
12.9k
12.9k views
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...
51 51 votes
4 answers 4 answers
17.5k
17.5k views
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{...
73 73 votes
10 answers 10 answers
23.8k
23.8k views
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{R...
58 58 votes
7 answers 7 answers
18.3k
18.3k views
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 ...
80 80 votes
9 answers 9 answers
31.1k
31.1k views
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...
56 56 votes
7 answers 7 answers
19.5k
19.5k views
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...
82 82 votes
7 answers 7 answers
31.8k
31.8k views
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...
3 3 votes
1 answers 1 answer
6.3k
6.3k views
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...
4 4 votes
2 answers 2 answers
5.4k
5.4k views
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...
3 3 votes
2 answers 2 answers
4.3k
4.3k views
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...
3 3 votes
1 answers 1 answer
5.8k
5.8k views
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...
3 3 votes
2 answers 2 answers
10.3k
10.3k views
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. ...
45 45 votes
7 answers 7 answers
16.1k
16.1k views
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...
37 37 votes
1 answers 1 answer
17.0k
17.0k views
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...
35 35 votes
7 answers 7 answers
12.0k
12.0k views
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...
48 48 votes
7 answers 7 answers
18.4k
18.4k views
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$
78 78 votes
10 answers 10 answers
26.7k
26.7k views
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...
40 40 votes
4 answers 4 answers
17.0k
17.0k views
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...