Crack
GATE
C
G
Topic
Data Link Layer
Computer Networks
0
/ 10 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
1
0.3
0
0.7
2018
0
0
0
0
2019
1
0
0
1
2020
0
0
0
0
2021
1.5
1
0
0.5
2022
0
0
0
0
2023
0
0
0
0
2024
0.5
0
0
0.5
2025
0
0
0
0
2026
1
0.5
0
0.5
1
CS 2026 Set 2 · 2 marks · MCQ · Moderate
Consider the transmission of data bits
110001011
110001011
110001011
over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be
1001
1001
1001
, which one of the following options shows the remainder bit pattern appended to the data bits before transmission?
2
CS 2026 Set 2 · 2 marks · NAT · Hard
It is necessary to design a link-layer protocol between two hosts that are directly connected over a lossless link of length
3000
3000
3000
kilometers. Assume that the link bandwidth is
10
8
10^8
1
0
8
bits per second and that the propagation delay in the link is
5
5
5
nanoseconds per meter. Every transmitted data byte is assigned a unique sequence number.
3
CS 2024 Set 2 · 2 marks · NAT · Easy
Consider an Ethernet segment with a transmission speed of
10
8
b
i
t
s
/
s
e
c
10^8\,\mathrm{bits/sec}
1
0
8
bits/sec
and a maximum segment length of
500
m
e
t
e
r
s
500\,\mathrm{meters}
500
meters
. If the speed of propagation of the signal in the medium is
2
×
10
8
m
e
t
e
r
s
/
s
e
c
2\times 10^8\,\mathrm{meters/sec}
2
×
1
0
8
meters/sec
, then the minimum frame size (in bits) required for collision detection is ____
4
CS 2021 Set 1 · 2 marks · MCQ · Moderate
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is
d
8
d
7
d
6
d
5
c
8
d
4
d
3
d
2
c
4
d
1
c
2
c
1
d_8d_7d_6d_5c_8d_4d_3d_2c_4d_1c_2c_1
d
8
d
7
d
6
d
5
c
8
d
4
d
3
d
2
c
4
d
1
c
2
c
1
, where the data bits and the check bits are given in the following tables:
5
CS 2021 Set 2 · 2 marks · MCQ · Moderate
Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial
X
3
+
X
+
1
X^3 + X + 1
X
3
+
X
+
1
. Suppose the message
m
4
m
3
m
2
m
1
m
0
=
11000
m_4 m_3 m_2 m_1 m_0 = 11000
m
4
m
3
m
2
m
1
m
0
=
11000
is to be transmitted. Check bits
c
2
c
1
c
0
c_2 c_1 c_0
c
2
c
1
c
0
are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by
m
4
m
3
m
2
m
1
m
0
c
2
c
1
c
0
m_4 m_3 m_2 m_1 m_0 c_2 c_1 c_0
m
4
m
3
m
2
m
1
m
0
c
2
c
1
c
0
. The value of the checkbit sequence
c
2
c
1
c
0
c_2 c_1 c_0
c
2
c
1
c
0
is
6
CS 2021 Set 2 · 2 marks · NAT · Moderate
Consider a network using the pure ALOHA medium access control protocol, where each frame is of length 1,000 bits. The channel transmission rate is
1
M
b
p
s
1\,\mathrm{Mbps}
1
Mbps
(
=
10
6
= 10^6
=
1
0
6
bits per second). The aggregate number of transmissions across all the nodes (including new frame transmissions and retransmitted frames due to collisions) is modelled as a Poisson process with a rate of 1,000 frames per second. Throughput is defined as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ____.
7
CS 2019 · 2 marks · NAT · Moderate
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 ____.
8
CS 2015 Set 1 · 2 marks · NAT · Moderate
Suppose that the stop-and-wait protocol is used on a link with a bit rate of
64
k
i
l
o
b
i
t
s
p
e
r
s
e
c
o
n
d
64\,\mathrm{kilobits\ per\ second}
64
kilobits
per
second
and
20
m
i
l
l
i
s
e
c
o
n
d
s
20\,\mathrm{milliseconds}
20
milliseconds
propagation delay. Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least
50
%
50\%
50%
is _______.
9
CS 2015 Set 1 · 2 marks · NAT · Moderate
Consider a LAN with four nodes
S
1
,
S
2
,
S
3
S_1, S_2, S_3
S
1
,
S
2
,
S
3
and
S
4
S_4
S
4
. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probabilities of generation of a frame in a time slot by
S
1
,
S
2
,
S
3
S_1, S_2, S_3
S
1
,
S
2
,
S
3
and
S
4
S_4
S
4
are
0.1
,
0.2
,
0.3
0.1, 0.2, 0.3
0.1
,
0.2
,
0.3
and
0.4
0.4
0.4
, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is ____.
10
CS 2015 Set 3 · 1 mark · MCQ · Moderate
Consider a CSMA/CD network that transmits data at a rate of
100
M
b
p
s
100\,\mathrm{Mbps}
100
Mbps
(
10
8
b
i
t
s
p
e
r
s
e
c
o
n
d
10^8\,\mathrm{bits\ per\ second}
1
0
8
bits
per
second
) over a
1
k
m
1\,\mathrm{km}
1
km
(kilometer) cable with no repeaters. If the minimum frame size required for this network is
1250
b
y
t
e
s
1250\,\mathrm{bytes}
1250
bytes
, what is the signal speed (
k
m
/
s
e
c
\mathrm{km/sec}
km/sec
) in the cable?