Time Left - 15:00 mins
GATE 2019 - Computer Network Quiz-2 (Flow & Error Control ) (App update required to attempt this test)
Attempt now to get your rank among 431 students!
Question 1
Consider there to be five collision which are then to be followed by a progress in case of a ALOHA user producing 50 requests/sec and also time is been slotted in 40msec units, then after considering all of the above cases find the probability of the mentioned collisions ______.
Question 2
We have three stations P, Q, R connected in serial manner. P is connected to Q through a 3Gbps fibre optic link and length is 500Km. Q is connected to R through 60Mbps link and length is 15Km.All the links are full duplex in nature. A file is sent from station A to C. Packet size is 1KB.We use sliding window protocol such that SWS=RWS. Find the optimal SWS packets.
Question 3
Which protocol is the most complex protocol among all ARQ protocols.
Question 4
Let P(X) be the polynomial used for CRC checking and the transmitted frame consists of n bits.Let P(X) = X4 +X2+1. Now consider the following statements.
1) All single bit errors can be detected.
2) It can detect odd number of bit errors
3) Burst error with length more than 6 can be detected with probability 1-2-6.
4) Burst error with length 6 can be detected with probability 1-2-6.
Which of the above statements are true?
1) All single bit errors can be detected.
2) It can detect odd number of bit errors
3) Burst error with length more than 6 can be detected with probability 1-2-6.
4) Burst error with length 6 can be detected with probability 1-2-6.
Which of the above statements are true?
Question 5
Consider the message given by network layer to the data link for its transmission is 01111110111110. Suppose a flag sequence of 8 bits is used to represent the starting and ending of the frame. If the flag sequence appears in the data set, bit stuffing is used to differentiate the data from flag. What will be the data sequence after bit stuffing which is transmitted to the physical layer, when flag sequence is 01111110?
Question 6
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error?
- 431 attempts
- 1 upvote
- 3 comments
Apr 7GATE & PSU CS
