Computer Networks Test 3

Number of Questions: 25 Section Marks: 30

Directions for questions 1 to 25: Select the correct alterna- 9. Match the following:
tive from the given choices. (A) Dividing the transmitted bit stream into frames
1. Which of the following layers of ISO/OSI model imple- (B) Determining which route the subnet has to use
ments ARP (address Resolution protocol)? (C) Fragment the incoming byte stream into discrete
(A) Data link layer (B) Network layer messages.
(C) Transport layer (D) Application layer I. TRANSPORT LAYER
II. DATA LINK LAYER
2. Which of the following routing has more chances for
III. NETWORK LAYER
getting TTL as zero?
(A) I–A, II–C, III–B (B) I–C, II–A, III–B
(A) Source routing
(C) I–A, II–B, III–C (D) I–B, II–C, III–A
(B) Router routing with default route
(C) Router routing with dynamic default route 10. Which of the following situations would not cause
(D) Routing will not affect the value of TTL packet retransmission?
(A) when packet TTL becomes zero
3. Which of these protocols doesnot accept the out of
(B) when there is congestion at the link
order packets?
(C) when the buffer is full at the router
(I) Go back N (II) selective repeat
(D) None of the above
(A) Only (I) (B) Only (II)
(C) Both (I) and (II) (D) None of the above 11. Consider a link with 10 Mbps bandwidth and 16 m sec
round trip time, if frame size is 1 K bytes then how
4. Which of the following is not the functionality of pres-
much percentage of link capacity is utilized?
entation layer?
(A) 9.5 (B) 7.8
(A) translation
(C) 5 (D) 12
(B) encryption
(C) compression 12. What will be the length of the packet if the senders uti-
(D) synchronizes the interaction between the two par- lization is 50%, Band width of the link is 10 Mbps and
ties the Round trip time is 4 msec?
(A) 40 KB (B) 8 KB
5. In 802.3 LAN the Bandwidth of the cable is 5 Mbps,
(C) 6 KB (D) 5 KB
velocity of propagation is 2.1 × 108 m/s, length of LAN
is 2.1 km, what is the minimum packet size? 13. What is the size of sender’s window for stop wand wait,
(A) 100 bits (B) 120 bits Go-back N and selective repeat, when the available
(C) 210 bits (D) 115 bits sequence numbers are 8.
(A) 1, 7 , 4 (B) 8, 8, 8
6. In 802.3 LAN the encoding technique used is:
(C) 4, 4, 4 (D) 2, 4, 8
(A) Manchester encoding
(B) defracted Manchester encoding 14. Host A sends 64 byte packets using sliding window
(C) Both (A) and (B) protocol to host B. The round trip delay between A and
(D) None of these B is 160 m sec Bandwidth of the link is 256 Kbps what
will be the optimal window size that A should use:
7. Match the following:
(A) 40 (B) 80
Column–I Column–II (C) 120 (D) 160
(1) Logical addressing (i) Data link layer 15. A computer on a 20 Mbps network is regulated by a
token bucket algorithm, the token bucket is filled at a
(2) Physical addressing (ii) Network layer
rate of 2 Mbps and it is initially filled with a capacity
(3) Service Point addressing (iii) Physical Layer of 16 Mbps. The duration for which the computer can
(iv) Transport layer transmit, at the maximum regulated output rate (in sec-
onds) is ________.
(A) 1–(i), 2–(iv), 3–(iii)
(A) 1.98 sec (B) 0.89 sec
(B) 1–(ii), 2–(iii), 3–(i)
(C) 2.5 sec (D) 3.0 sec
(C) 1–(iii), 2–(i), 3–(iv)
(D) 1–(ii), 2–(i), 3–(iv) 16. The message 100011001 is to be transmitted using the
CRC polynomial x3 + x2 + 1 the message that should be
8. CHECKSUM calculations for a packet is done by:
transmitted is:
(A) data link layer (B) network layer
(A) 1000110010000 (B) 1000110010100
(C) transport layer (D) physical layer
(C) 1000110011001 (D) 1000110011000
 Computer Networks Test 3 | 3.199

17. In 802.3, A and B are the only two stations each has a 22. Consider network:
steady queue of frames to send, both A and B attempt 1
2
to transmit a frame, collide and A wins the first back A B E
off race. At the end of this successful transmission by
A both A and B attempt to transmit, collide and A again 5 2 1
wins the back off race, at the end of this successful
transmission by A, both A and B attempt to transmit,
collide and A again wins the back off race. At the end
of this successful transmission by A, both the stations D C F
2 3
attempt to transmit and collide. The probability that B
wins the first back off race is: At t = 0, the distance vector is
(A) 0.625 (B) 0.0625
(C) 0.75 (D) 0.075 Information stored Distance to reach node
18. Consider the following figure: A B C D E F
B F A 0 2 ∞ 5 ∞ ∞
A B 2 0 2 ∞ 1 ∞
D E G C ∞ 2 0 2 ∞ 3
C D 5 ∞ 2 0 ∞ ∞
H
E 0 1 ∞ ∞ 0 3
For the above network, ignore the line weights, suppose F ∞ ∞ 3 ∞ 3 0
flooding is used for the routing algorithm. If a packet is What would be the distance vector in next cycle?
sent from ‘D’ to ‘G’, with a maximum hop count of 3, (A)
list all the routes it take and how many packets are sent
in this flooding? Information Distance to reach nodes
(A) 5 Routes, 11 packets stored at node A B C D E F
(B) 4 Routes, 11 packets A 0 2 4 5 3 ∞
(C) 4 Routes, 3 packets
B 2 0 2 4 1 2
(D) 5 Routes, 5 packets
C 4 2 0 2 3 3
19. A network system with n-layers, Application generated
message of length m-bytes. If each layer adds an h-byte D 5 4 2 0 ∞ 5
header what fraction of network Bandwidth is filled E 3 1 3 ∞ 0 3
with headers? F ∞ 2 3 5 3 0
(A) h/(n × m) bytes
(B) h × n × m bytes (B)
(C) (n × h)/m bytes Information Distance to reach node
(D) m/(n × h) bytes stored at node A B C D E F
20. Consider the following bit stream
A 0 2 4 5 3 ∞
‘01111010111111011110111’ using bit stuffing fram-
ing method in the data link layer, how many 0s should B 2 0 2 4 1 4
be stuffed in the data using a flag pattern of ‘011110’? C 4 2 0 2 3 3
(A) 3 (B) 4 D 5 4 2 0 ∞ 5
(C) 5 (D) 6
E 3 1 3 ∞ 0 3
21. Match the following:
F ∞ 2 3 5 3 0
(a) Distance vector routing (I) BGP
(C)
(b) Link state routing (II) RIP
Information Distance to reach node
(c) Path vector protocol (III) OSPF
stored at node A B C D E F
(A) a–III, b–II, c–I
A 0 2 4 1 3 ∞
(B) a–II, b–III, c–I
(C) a–I, b–II, c–III B 2 0 2 4 1 2
(D) a–I, b–II, c–III C 4 2 0 2 3 3
3.200 | Computer Networks Test 3

D 5 1 2 0 ∞ 5 (A) (i) and (iii) are correct

(B) (i) and (iv) are correct
E 3 1 3 ∞ 0 3 (C) (ii) and (iii) are correct
F ∞ 4 3 5 3 0 (D) All statements are correct
(D) 24. Which of the following is TRUE about routing infor-
mation protocol (RIP)?
Information Distance to reach node (a) RIP is based on distance vector routing
stored at node A B C D E F (b) RIP protocol is slow converging and instable
∞ ∞ (c) the router forwards only the packets that have
A 2 4 5 3
traveled the shortest path from the source to the
B 2 0 2 4 1 4 route
C 4 2 0 2 3 3 (d) RIP uses Dijkstra algorithm to determine best
D 5 4 2 0 ∞ 5 path to a particular destination.
(A) Only (a) and (b) (B) Only (a) and (d)
E 3 1 3 ∞ 0 3
(C) Only (b) and (c) (D) Only (c) and (d)
F ∞ 4 3 5 3 0 25. Which of the following is TRUE about open shortest
23. Which of the following statements are correct, when path first protocol?
router malfunctions? (a) OSPF is based on link state routing
(i) each node computes only its own table (b) OSPF routing tables are calculated by using Dijk-
(ii) node can advertise incorrect link cost in link state stra algorithm
algorithm (A) Only (a) is correct
(iii) Each node’s table is used by other in distance vec- (B) Only (b) correct
tor (C) (a) and (b) are correct
(iv) Distance vector node can advertise in correct path (D) (a) and (b) are false
cost

Answer Keys
1. A 2. B 3. A 4. D 5. A 6. A 7. D 8. C 9. B 10. D
11. C 12. D 13. A 14. B 15. B 16. D 17. B 18. B 19. C 20. C
21. B 22. A 23. D 24. A 25. C

Hints and Explanations

1. ARP (Address Resolution Protocol) maps IP addresses L d

to hardware addresses. It is used by Internet protocol i.e., 2× = 2×
B v
(IP) and used in Data link layer. Choice (A)
L 2.1 × 103 m
2. TTL (Time To Leave) is a field in a IP header which 2× = 2 ×
avoids packet going in to infinite loop. In default route 5 × 106 2.1 × 108
routing there are more chances for getting a packet in L = 100 bits. Choice (A)
to an infinite loop. Choice (B) 6. In 802.3, Manchestar encoding is used for data encod-
3. In Go back–N protocol, Receiver can’t receive out of ing. In this, coding data bit is either high, low or of
order packet, if it receives it sends NAK. In selective equal time. Choice (A)
repeat, it can receive out of order packets and sorting 7. (1) Logical addressing is implemented in Network
algorithm is used for sorting the packets at the receiver layer
end. Choice (A) (2) Physical addressing is implemented in data link
4. The functionalities of the presentation layer is layer
(a) Encoding (3) Service point addressing is implemented in Trans-
(b) Encryption port layer. Choice (D)
(c) Compression Choice (D) 8. The end to end error control in a network is done by
5. Condition for minimum packet size in Ethernet: Transport layer by using checksum.
Transmission delay = round trip delay Choice (C)
 Computer Networks Test 3 | 3.201

9. Data Link Layer divides bit stream into frames. 16 + 2t = 20t

One of the main functionality of Network Layer is rout- ⇒ 16 = 18t ⇒ t = 0.89 seconds Choice (B)
ing. 16. Message = 100011001 divisor = 1101 and CRC remain-
Fragmentation is done by Transport Layer. der is 1000 the transmitted message is 1000110011000.
Choice (B) Choice (D)
10. The packet gets discarded 17. A has two conditions to win first back off race (0, 1) &
When TTL becomes zero B has eight conditions (0, 1, 2, 3, 4, 5, 6 and 7) i.e., B
When there is congestion at the link 1
When the buffer is full at the router Choice (D) has only one chance to win i.e., = 0.0625.
16
1 K bytes Choice (B)
11. Throughput =
16 m sec 18. See the figure given below:
1 × 103 × 8 bits B F
=
16 × 10 −3 sec A
106 D E G
= × bps
2 C
H
% of link utilization
106
= × 100 Hop 1 (→), Hop 2 (→), Hop 3 (→)
2
11 packets are sent in this flooding.
10 × 106 In Hop 1, 3 packets are sent (→)
106 In Hop 2, 6 packets are sent (→)
= × 100 = 5%. In Hop 3, 2 packets are sent (→) Choice (B)
2 × 10 × 106
Choice (C) 19. Network with ‘n’ layers adds ‘n’ – h – byte headers to a
packet of length ‘m’ then the fraction of network band-
12. When senders utilization is 50% then
width filled with headers are 
n×h
L = BR  bytes.
where L = length of the packet  m 
Choice (C)
B = Band width of link
R = Round trip time 20. Data will be stuffed as
\ L = 10 × 106 × 4 × 10–3 bits 011101010111011100
= 10 ×4 × 103 bits ↑ ↑ ↑
= 40 × 103 bits 1110101110
= 5 KB. Choice (D) ↑ ↑
After every 3 consecutive 1s we will stuff ‘0’ bit there-
13. When N is the available sequence numbers, then
fore total = 5. Choice (C)
sender’s window size of stop and wait, Go-back N and
N 21. • Distance vector routing is implemented using RIP.
selective repeat are 1, N – 1, ⋅ Choice (A) • Link state routing is implemented using OSPF.
2
• Path vector protocol includes BGP. Choice (B)
14. R.T.T = 160 × 10–3 sec
22. In distance vector routing, at every step shortest path
B.W = 256 × 103 bps
are calculated to the all nodes from its neighbours.
(Band width)
Choice (A)
Length of the packet
= 256 × 160 × 103 × 10–3 23. The functionalities in the above all statements are per-
= 256 × 160 formed by a mal functioned router. Choice (D)
256 × 160 24. RIP uses the hop count for the packet routing and there
Window size = = 80. Choice (B)
64 × 8 is no compulsive that it should be shortest.
RIP uses Bellman–Ford algorithm for finding shortest
15. Capacity of the bucket (C) = 16 Mbps path. Choice (A)
Maximum regulated output rate (M) = 20 Mbps
()
Token filling rate ∫ = 2 Mbps
25. OSPF is based on link state routing.
Paths among the nodes are calculated using Dijkstra’s
Time duration for incoming bursty traffic (t) = ? algorithm. Choice (C)
C + ∫ t = Mt