Questions on Flow & Error control

Q1. In Go-Back-N ARQ, if frames 4, 5 and 6 are received successfully, the

receiver may send an ACK _______ to the sender.

(a) 5 (b) 6
(c) 7 (d) any of the above

Q2. In Go-Back-N ARQ, if 5 is the number of bits for the sequence number, then
the maximum size of the send window must be ______
(a) 15 (b) 16
(c) 31 (d) 1
Q3. Consider the sliding window flow-control protocol operating between a
sender and a receiver over a full-duplex error-free link. Assume the following:
• The time taken for processing the data frame by the receiver is negligible.
• The time taken for processing the acknowledgement frame by the sender
is negligible.
• The sender has infinite number of frames available for transmission.
• The size of the data frame is 2,000 bits and the size of the
acknowledgement frame is 10 bits.
• The link data rate in each direction is 1 Mbps (=106 bits per second).
• 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_____________.
(a) 51 (b) 70
(c) 101 (d) 170
Q4. Bit stuffing refers to
(a) inserting a 0 in user stream to differentiate it with a flag
(b) inserting a 0 in flag stream to avoid ambiguity
(c) appending a nipple to the flag sequence
(d) appending a nipple to the use data stream

Q5. Consider the cyclic redundancy check (CRC) based error detecting scheme
having the generator polynomial X3+X+1. Suppose the message m4m3m2m1m0 =
11000 is to be transmitted. Check bits c2c1c0 are appended at the end of the
message by the transmitter using the above CRC scheme. The transmitted bit
string is denoted by m4m3m2m1m0c2c1c0. The value of the checkbit sequence
c2c1c0 is __________
(a) 101 (b) 110
(c) 100 (d) 111

Q6. The checksum of 10010010 and 00111000 (8-bit segment) is _______

(a) 00110110
(b) 11001010
(c) 00110101
(d) None of these
Q7. 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?

I. 0010111 II. 0110110 III. 1011010 IV. 0111010

(a) I and III

(b) I, II and III

(c) II and IV

(d) I, II, III and IV

Q8. Consider that 15 machines need to be connected in a LAN using 8-port

Ethernet switches. Assume that these switches do not have any separate uplink
ports. The minimum number of switches needed is __________.
(a) 2 (b) 3
(c) 4 (d) 5
Q9. What is the propagation time if the distance between the two points is
48,000? Assume the propagation speed to be 2.4 × 108 meter/second in
cable.
(a) 0.5ms (b) 20ms
(c) 50ms (d) 200ms
Q10. Assume that a 12-bit Hamming code word 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:

Which one of the following choices gives the correct values of x and y?

(a) x is 0 and y is 0
(b) x is 0 and y is 1
(c) x is 1 and y is 0
(d) x is 1 and y is 1

Q11. Consider a network connecting two systems located 8000 kilometers apart.
The bandwidth of the network is 500 × 106 bits per second. The propagation
speed of the media is 4 × 106 meters per second. It is needed to design a Go-
Back-N sliding window protocol for this network. The average packet size is
107 bits. The network is to be used to its full capacity. Assume that processing
delays at nodes are negligible. Then, the minimum size in bits of the sequence
number field has to be ________.
(a) 2 (b) 4
(c) 8 (d) 16
Q12. In SR protocol, suppose frames through 0 to 4 have been transmitted. Now,
imagine that 0 times out, 5 (a new frame) is transmitted, 1 times out, 2 times out
and 6 (another new frame) is transmitted.
At this point, what will be the outstanding packets in sender’s window?
(a) 341526 (b) 3405126
(c) 0123456 (d) 654321
Q13. Which of the following is a MAC address?
(a) 192.166.200.50
(b) 00056A:01A01A5CCA7FF60
(c) 568, Airport Road
(d) 01:A5:BB:A7:FF:60

Q14. Station A needs to send a message consisting of 9 packets to Station B

using a sliding window (window size 3) and go-back-n error control strategy.
All packets are ready and immediately available for transmission. If every 5th
packet that A transmits gets lost (but no acks from B ever get lost), then what is
the number of packets that A will transmit for sending the message to B?
(a) 12 (b) 14
(c) 16 (d) 18
Q15. The selective repeat protocol is similar to Go back N except in the
following way-
(a) Frame Formats are similar in both the protocols
(b) The sender has a window defining maximum number of outstanding frames
in both the protocols
(c) Both uses piggybacked acknowledgements where possible and does not
acknowledge every frame explicitly.
(d) Both uses only Cumulative acknowledgment approach.
Ans:
1) C
2) C
3) A
4) A
5) C
6) C
7) A
8) B
9) D
10) A
11) C
12) B
13) D
14) C
15) C