ERROR CONTROL PROTOCOLS
DPP- 01
Framing and Flow Control Protocols Q6. A channel has a bit rate of 20 Kbps and one -
way propagation delay of 100 ms . The channel
Q1. A sliding window protocol of 4 Mbps point to uses stop - & - wait protocol . Assume that the
point Link has propagation delay of 0.5 sec. size of acknowledgement frame is 100 bytes .
Assume that each frame carries 2 KB of data. What will be the channel utilization (in
What is the maximum number of bits used for percentage) if size of each frame is 1000 bytes.
the sequence number field? MCQ
NAT [ ]
A. 25% B. 62.5%
Q2. A system user the sliding window protocol is C. 75% D. 90%
having a bandwidth of 10 Mbps with a window
size of 50. What is the size of data (in bytes) if Q7. Suppose a sender is using the Sliding Window
the distance between the Sender and receiver is Protocol with a 4-bit sequence number field.
7200 km and the propagation speed is 3 × What will be the sequence number assigned to
10^8 m / sec ? the 100th frame transmitted?
Given Utilization of channel as 0.5. NAT [ ]
NAT [ ]
Q8. Which of the following is/are possible as sender
Q3. Suppose that the flag pattern in framing and receiver window size if selective repeat
protocol is given as 0111. If the transmitted is protocol is used. Assume that they are using 5-
data 101110100111001101. The what is the bits for sequence number field.
number of stuff bits in transmitted data X ? MSQ
NAT [ ]
A. (8,8) B. (16,16)
Q4. Station A need to send a message consisting of C. (17,17) D. (20,20)
15 Packets to Station ' B ' = Using a sliding
window ( Ws = 4 ) and go - back - N error Q9. The values of parameters for the Stop-and-Wait
control strategy . All Packets are ready and ARQ protocol are as given below:
immediately available for transmission . If every • Bit rate of the transmission channel = 1 Mbps
6th Packet that ' A ' transmits gets lost ( but no • Propagation delay from sender to receiver =
Acks from ' B ' ever gets lost ) , then what is the 0.75 ms.
number of Packets that ' A ' will transmit for • Time to process a frame = 0.25 ms.
sending the message to ' B ' ? • Number of bytes in the information frame =
MCQ 1980.
• Number of bytes in the acknowledgement
( A ) 29 ( B ) 27 frame = 20.
( C ) 21 ( D ) 25 • Number of overhead bytes in the information
frame = 20.
Q5. A 25 Kbps satellite link has a propagation delay Assume that there are no transmission errors.
of 400 ms . The transmitter employs " Selective Then, the transmission efficiency (expressed in
Repeat " Scheme with N set to 16. Assume each percentage) of the Stop-and-Wait ARQ
frame is 100 bytes long . What is maximum protocol for the above parameters is _______
achievable throughput for this channel ? ( (correct to 2 decimal places).
Where N is window size ) . NAT [ ]
MCQ
A. 5 Kbps B. 10 Kbps
C. 12 Kbps D. 15 Kbps
ERROR CONTROL PROTOCOLS
DPP- 01
Q10. In the Sliding Window Protocol, under which of
the following conditions will the number of bits
required to represent the sequence numbers
increase?
MSQ
A) If the size of each frame increases
B) If the bandwidth of the channel increases
C) If the distance between the two stations
decreases
D) If the speed of signal between the sender
and receiver decreases
ERROR CONTROL PROTOCOLS
DPP- 01
Flow Control Protocols Q7. Find maximum utilization of channel in Go-
back-N protocol considering full duplex link
Q1. A file consisting of 50,000 characters takes 40 having transmission speed of 10 Mbps and size
second to send, then data rate is ________ of each frame 1000 bits with one way
(kbps) ? propagation delay of 5 ms. Assume that
NAT transmission time acknowledgment is
negligible and size of window is 10 __________?
Q2. In full duplex channel, if the data rate of link is NAT
20 Mbps and signal speed is 200 m/s. The
number of bytes that can be placed into the Q8. Consider a framing protocol with flag pattern of
channel of 100 km is __________? 01111. Which of the following options is/are
NAT TRUE?
Q3. A chanel has bit rate of 10kbps and one way A. If the sender wish to send data = 10111 then
propagation delay of 20ms. The channel uses it will be transmitted as it is, since no lag
Stop and Wait Protocol. The transmission time pattern exists.
of acknowledgement is negligible. To get B. If the sender wish to transmit the data =
channel efficiency of 60%, the minimum frame 10111011111101 then number of stuff bits
size should be ________ (Bytes) ? required is 3 to avoid flag from data part.
NAT C. Framing protocol is used by sender to
Q4. On the wireless link, the probability of packet support receiver to distinguish individual
error is 0.25. Stop and Wait protocol is used to frames.
transfer data. What is the average number of D. Bit stuffing is used in flag as well as data
transmission required to transfer 200 packets section of frame.
successfully ____________? MSQ
NAT
Q9. Consider 8 Mbps satellite communication link
Q5. A network with bandwidth of 10 Mbps can pass with one way propagation delay of 150 ms. Size
on average of 18000 frames per minutes with of frame is 1000 bytes and neglect transmission
each frame carrying 10^4 bits. What is the time of acknowledgement.
throughput of this channel ?
MCQ Which of the following options is/are TRUE?
A. For maximum utilization of channel, the
A) 10 Mbps B) 5 Mbps minimum number of bits required for
C) 3 Mbps D) 2 Mbps sequence number field is 8-bits if GBN
sliding window protocol is used.
B. For maximum utilization of channel, the
Q6. Consider a 10 Mbps link with channel utilization minimum number of bits required for
of 80%. Network is using sliding window sequence number field is 10-bits if SR
protocol. The throughput of channel is _______ protocol is used.
(Mbps) C. The effective bandwidth OR throughput is 4
NAT Mbps for 50% channel utilization, if sliding
window protocol is used.
D. The maximum window size of sender for
60% channel utilization is 180.
MSQ
ERROR CONTROL PROTOCOLS
DPP- 01
Q10. Consider the store and forward packet switch
network described below. Assume that
bandwidth of each link is 10^6 bytes/sec. A
user on host A sends a file of size 10^3 bytes to
host B through routers R1 and R2 in two
different ways. In first case a single packet
containing the complete file is transmitted from
A to B. In second case, the file is split into 20
equal parts and these packets are sent from A
to B. Each packet contains 100 bytes of header
information along with user data. Consider only
transmission time and ignore processing,
queuing and propagation delay. Also assume
that there are no error during transmission. Let
T1 and T2 time taken to transmit the file in two
different cases. Which of the following option is
CORRECT?
A. T1 > T2
B. T1<T2
C. T1=T2
D. None
MCQ
ERROR CONTROL PROTOCOLS
DPP- 01
Error Control Protocols Q6. Which of the following statements about error
detection codes are correct?
Q1. A sender uses even parity for a 7-bit dataword
1011001. What will be the transmitted (A) Parity check fails to detect all 2-bit errors
codeword? (B) CRC can detect all single-bit errors and all
odd number of bit errors if polynomial has
(A) 10110010 (B) 10110011 (x+1) as a factor
(C) 10110001 (D) 10110000 (C) Hamming code with distance 3 can correct
2-bit errors
Q2. A communication link uses CRC with generator (D) Checksum is stronger than CRC in detecting
polynomial G(x)=x^3+x+1. For a dataword burst errors
1101, the transmitted codeword (data + CRC
bits) will be: Q7. In a communication system using a Hamming
(7,4) code:
(A) 1101110 (B) 1101001
(C) 1101101 (D) 1101011 (A) It can detect all 2-bit errors
(B) It can correct all 1-bit errors
Q3. In a Hamming code using even parity, the (C) The number of parity bits used is 3
minimum Hamming distance between valid (D) Minimum Hamming distance is 3
codewords is:
Q8. In a CRC scheme, the generator polynomial is
(A) 1 (B) 2 G(x)=x4+x+1G(x) = x^4 + x + 1 and the
(C) 3 (D) 4 dataword is 1010101. How many CRC bits will
be appended to the dataword?
Q4. A checksum method detects all errors involving:
Q9. In a system with bit error probability p=10^(-4),
(A) Any odd number of bit errors if we transmit 1000-bit frames using a simple
(B) All burst errors of length ≤ checksum length parity bit, the probability that an undetected
(C) All possible 1-bit and 2-bit errors error occurs is approximately:
(D) All errors in which sum of words changes
Q10. A Hamming code uses even parity with 4 data
Q5. Which of the following is true about CRC error bits. What is the total length of the transmitted
detection? codeword (including parity bits)?
(A) CRC can detect all single-bit errors
(B) CRC can detect all double-bit errors for any
generator polynomial
(C) CRC can detect all burst errors of length ≤
degree of generator polynomial
(D) CRC can correct single-bit errors without
retransmission
ERROR CONTROL PROTOCOLS
DPP- 01
Media Access Control Protocols
Q1. Let a cluster of stations share 48 kbps of pure
Aloha channel. Every station outputs frames of
length 1024 bits on an average of every 50
seconds. Then what is the maximum value of
number of stations?
(A) 413 (B) 431
(C) 453 (D) 435
Q2. A building running CSMA-CD Protocol is having
a bandwidth of 512 Mbps and distance of 2 km
then determine the minimum data size in order
to detect a collision . Assume that the signal
speed is 2 × 10^5 km / s .
(A) 1000 Bytes (B) 1250 bytes
(C) 1280 bytes (D) 1024 bytes
Q3. Suppose a CSMA / CD Network is operating 1
Gbps , and suppose there are no repeaters and
the length of cable is 1 km . Determine the
minimum frame size is the signal propagation
speed is 200 km / ms .
ERROR CONTROL PROTOCOLS
DPP- 01
Transport Layer
Q1. The following is a dump of UDP header in
hexadecimal format 5000013297EFAFDC What
is the total length of user datagram? Is the
packet from client to server or vice versa?
(A) 30 bytes and packet is going from client to
server
(B) 28 bytes and packet is going from client to
server
(C) 30 bytes and packet is going from server to
client
(D) 28 bytes and packet is going from server to
client
Q2. Given the maximum lifetime of a segment is 30
sec and link capacity is 500 Mbps , find the
number of bits required to avoid wrap around
during this time ?
(A) 10 bits (B) 23 bits
(C) 30 bits (D) 31 bits
