Following questions have been asked in GATE CS 2009 exam.
1) 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?
(A) G(x) contains more than two terms
(B) G(x) does not divide 1+x^k, for any k not exceeding the frame length
(C) 1+x is a factor of G(x)
(D) G(x) has an odd number of terms.
Odd number of bit errors can be detected if G(x) contains (x+1) as a factor. See this for proof.
2) Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).
What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
Transmission delay for 1 frame = 1000/(10^6) = 1 ms
Propagation time = 25 ms
The sender can atmost transfer 25 frames before the first frame reaches the destination.
The number of bits needed for representing 25 different frames = 5
3) Consider the data of previous question. Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the previous question and acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time.)
Size of sliding window = 2^5 = 32
Transmission time for a frame = 1ms
Total time taken for 32 frames = 32ms
The sender cannot receive acknoledgement before round trip time which is 50ms
After sending 32 frames, the minimum time the sender will have to wait before starting transmission of the next frame = 50 – 32 = 18
Please see GATE Corner for all previous year paper/solutions/explanations, syllabus, important dates, notes, etc.
Please write comments if you find any of the answers/explanations incorrect, or you want to share more information about the topics discussed above
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Computer Networks | Set 1
- Computer Networks | Set 2
- Computer Networks | Set 5
- Computer Networks | Set 3
- Computer Networks | Set 4
- Computer Networks | Set 6
- Computer Networks | Set 7
- Computer Networks | Set 8
- Computer Networks | Set 9
- Computer Networks | Set 10
- Computer Networks | Set 11
- Commonly asked Computer Networks Interview Questions | Set 1
- Computer Networks | Set 14
- Computer Networks | Set 13
- Last Minute Notes - Computer Networks
- Congestion Control in Computer Networks
- Error Detection in Computer Networks
- Computer Networks | IP Addressing | Question 5
- Computer Networks | IP Addressing | Question 6
- Line Configuration in Computer Networks