Consider the following C code segment:
a = b + c;
e = a + 1;
d = b + c;
f = d + 1;
g = e + f;
In a compiler, this code segment is represented internally as a directed acyclic graph (DAG). The number of nodes of nodes in the DAG is ______
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1, where the data bits and the check bits are given in the following tables:
|
Data bits |
|||||||
|
d8 |
d7 |
d6 |
d5 |
d4 |
d3 |
d2 |
d1 |
|
1 |
1 |
0 |
x |
0 |
1 |
0 |
1 |
|
c8 |
c4 |
c2 |
c1 |
|
Y |
0 |
1 |
0 |
Which one of the following choices gives the correct values of x and y?
Consider two hosts P and Q connected through a router R. The maximum transfer unit (MTU) value of the link between P and R is 1500 bytes, and between R and Q is 820 bytes.
A TCP segment of size 1400 bytes was transferred from P to Q through R, with IP identification value as 0 × 1234. Assume that the IP header size is 20 bytes. Further, the packet is allowed to be fragmented i. e, Don't Fragment (DF) flag in the IP header is not set by P.
Which of the following statements is/are correct?
Consider the sliding window flow-control protocol operating between a sender and a receiver over a full-duplex error-free link. Assume the following:
1. The time taken for processing the data frame by the receiver is negligible.
2. The time taken for processing the acknowledgement frame by the sender is negligible.
3. The sender has infinite number of frames available for transmission.
4. The size of the data frame is 2,000 bits and the size of the acknowledgment frame is 10 bits.
5. The link data rate in each direction is 1 Mbps (= 106 bits per second).
6. One way propagation delay of the link is 100 milliseconds.
The minimum value of the sender's window size in terms of the number of frames, (rounded to the nearest integer) needed to achieve a link utilization of 50% is ______