Computer Network Gate MCQ Ques
Computer Network Gate MCQ Ques
(C) 3000ms
(D) 3003ms
Answer (A)
R2 (2, 7, 8, 9)
Links used: R2-R3, R2-R4, R4-R5, R4-R6
R3 (9, 9, 11)
Links used: R3-R2, R2-R4, R3-R5, R4-R6
R4 (1, 2)
Links used: R4-R5, R4-R6
R5 (3)
Links Used: R5-R4, R4-R6
If we mark, all the used links one by one, we can see
that all links are used except the following link
R5-R6
Let transmission time to transfer 1 byte for all nodes be t. The first packet will take
time = (packet size)*3*t. After the first packet reaches the destination, remaining
packets will take time equal to (packet size)*t due to parallelism.
If we use 4 bytes as packet size, there will be 24 packets
Total Transmission time = Time taken by first packet +
Time taken by remaining packets
= 3*4*t + 23*4*t = 104t
3) Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-
bit jamming signal is 46.4 ms. The minimum frame size is:
(a) 94
(b) 416
(c) 464
(d) 512
Answer (c)
Transmission Speed = 10Mbps.
Round trip propagation delay = 46.4 ms
The minimum frame size = (Round Trip Propagation Delay) * (Transmission Speed)
= 10*(10^6)*46.4*(10^-3) = 464 * 10^3 = 464 Kbit
The concept behind the above formula is collision detection. Consider a situation
where a node A wants to send a frame to another node B. When Node A begins
transmitting, the signal must propagate the network length. In the worst-case
collision scenario, Node B begins to transmit just before the signal for Node A’s
frame reaches it. The collision signal of Node A and Node B’s frame must travel back
to Node A for Node A to detect that a collision has occurred.
The time it takes for a signal to propagate from one end of the network to the other is
known as the propagation delay. In this worst-case collision scenario, the time that it
takes for Node A to detect that its frame has been collided with is twice the
propagation delay. Node A’s frame must travel all the way to Node B, and then the
collision signal must travel all the way from Node B back to Node A. This time is
known as the slot time. An Ethernet node must be transmitting a frame for the slot
time for a collision with that frame to be detected. This is the reason for the minimum
Ethernet frame size.
00010001 000
1001
00000011 000
10 01
00000001 010
1 001
Answer (C)
Distance between stations = L KM
= n/[1 + 2LtR/k]
= nk/(2LtR+k)
Therefore, n = (2LtR+k)/k
(A) P – 2 Q – 1 R – 3 S – 5
(B) P – 1 Q – 4 R – 2 S – 3
(C) P – 1 Q – 4 R – 2 S – 5
(D) P – 2 Q – 4 R – 1 S – 3
Answer (B)
SMTP is an application layer protocol used for e-mail
transmission.
TCP is a core transport layer protocol.
BGP is a network layer protocol backing the core routing
decisions on the Internet
PPP is a data link layer protocol commonly used in
establishing a direct connection between two networking
nodes.
Computer Networks | Set 11
Bandwidth = 128kbps
= n/(1+80/2)
= (203.197.2.53) &
(255.255.128.0)
= 203.197.0.0
C1 sees network ID of C2 as bitwise '&' of IP
of C2 and subnet mask of C1
= (203.197.75.201) &
(255.255.128.0)
= 203.197.0.0
= (203.197.75.201) &
(255.255.192.0)
= 203.197.64.0
= (203.197.2.53) &
(255.255.192.0)
= 203.197.0.0
2 1
3 2
4 3
5 4
7 6
7
[Timeout for 5]
5
6 5
7 6
8
9
[Timeout for 7]
8 7
9 8
[Timeout for 9]
9
Computer Networks | Set 12
Therefore,
p = 45/2 = 22.5 ms
Now, lets find transmission delay (t), you know that, t = L/B
(where, L= size of packet and B= bandwidth). Therefore,
L = 1KB = (1024*8) = 8192 bits
And
B = (1.5*106)
So,
t = L/B = 8192/(1.5*106) = 5.461 ms
Thus efficiency,
= 1/(1 + 2a) {where a = p/t = 22.5/5.461 =
4.12}
= 1/(1 + 2*4.12)
= 0.108
= 10.8 %
So,
p = propagation delay
= (d/v) = (103/2*108) = 5*10(-6)
Therefore, minimum size of the packet is,
= (2*p*BW)
= 2*5*10(-6)*107
= 100 bits
So, option (D) is correct.
Ques-4: Consider Subnet mask of class B network on the
internet is 255.255.240.0 then, what is the maximum number
of hosts per subnets?
(A) 4098
(B) 4096
(C) 4094
(D) 4092
Explanation:
To find number of hosts per Subnet, you need to check
number of zeroes in the host id part.
Here, Subnet mask
= 255.255.240.0
= 11111111.11111111.11110000.00000000
Therefore, number of zeroes is 12 so,
Number of hosts
= (212 - 2)
= 4096 - 2
= 4094
Since, one of them is used for network id of entire network
and the other one is used for the directed broadcast address of
the network so, two is subtracted.
So, option (C) is correct.
Ques-5: What is the maximum window size for data
transmission Using Selective Repeat protocol with n-bit frame
sequence number?
(A) 2n
(B) 2n-1
(C) 2n-2
(D) 2n-1
Explanation:
Since, window size of sender(W) = window size of the
receiver(R) and we know that,
(W + R) = 2n
or, (W + W) = 2n since, (W = R)
or, 2*W = 2n
or, W = 2n-1
Hence, option (D) is correct.
1
Computer Networks | Set 14