Computer Networks
Concepts of Layering
Marks 1Marks 2
Data Link Layer and Switching
Marks 1Marks 2
Network Layer
Marks 1Marks 2
Application Layer Protocol
Marks 1Marks 2
Routing Algorithm
Marks 1Marks 2
TCP UDP Sockets and Congestion Control
Marks 1Marks 2
Lan Technologies and Wi-Fi
Marks 1Marks 2
Network Security
Marks 1Marks 2
1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. 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.
A
I = 2
B
I = 3
C
I = 4
D
I = 5
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message that should be transmitted is:
A
11001001000
B
11001001011
C
11001010
D
110010010011
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol is used, is:
A
$$\left\lceil {{{\log }_2}{{2LtR + 2K} \over K}} \right\rceil $$
B
$$\left\lceil {{{\log }_2}{{2LtR} \over K}} \right\rceil $$
C
$$\left\lceil {{{\log }_2}{{2LtR + K} \over K}} \right\rceil $$
D
$$\left\lceil {{{\log }_2}{{2LtR + 2K} \over {2K}}} \right\rceil $$
4
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
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
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization