DATA LINK MEDIUM ACCESSCONTROL

Q1. Suppose that the ALOHA protocol is used to share a 56 kbps satellite channel. Suppose
that frames are 1000 bits long. Find the maximum throughput of the system in
frames/second.___________

Solution:
Maximum throughput for ALOHA = (½)e−1 = 0.1839
Maximum throughput in frames/sec = (56000 bits/sec) x (1 frame/1000 bits) x 0.184 =
10.304 The maximum throughput is approximately 10 frames/sec.
Q2. Suppose that the slotted ALOHA protocol is used to share a 56 kbps satellite channel.
Suppose that frames are 1000 bits long. Find the maximum throughput of the system in
frames/second.___________

Solution:
Maximum throughput for Slotted ALOHA = e−1 = 0.3679
Maximum throughput in frames/sec = (56000 bits/sec) x (1 frame/1000 bits) x 0.368 =
20.608 The maximum throughput is approximately 20 frames/sec.
Data for next four questions. Suppose three active nodes - nodes A, B, and C- are competing for
access to a channel. Assume that, time is divided into slots and each node has an infinite number
of packets to send. Each node attempts to transmit in each slot with probability p. The first slot is
numbered slot 1, the second slot is numbered slot 2, and so on. Answer the following questions.
Q3. What is the probability P1 that node A succeeds for the first time in slot 4?
(a) p*(1 - p)^2 (b) 3p*(1 - p)^2
(c) p(1 - p)^2(1 - p(1 - p)^2)^3 (d) (1 - 3p(1-p)^3)^2  3p(1-p)^3

Solution:
Probability :- (probability of A fails in first 3 slot)*probability of A successes in a slot)
probability if A fails in a slot = 1-probability of success
Probability of success of A in
= P(1-P)2
 A transmits*(B&C does not transmits)
probability of A fails in a slot = 1-(P(1-P)2)
Probability of A fails in first three slots = (1-(P(1-P)2)3
Probability of A succeeds in slot 4 for first time
= (1-(P(1-P)2)3(P(1-P)2)
i.e. option (a)
Answer:C
Q4. What is the probability P2 that some node (either A, B or C) succeeds in slot 3?
(a) p*(1 - p)^2 (b) 3p*(1 - p)^2
(c) p(1 - p)^2(1 - p(1 - p)^2)^3 (d) (1 - 3p(1-p)^3)^2  3p(1-p)^3

Solution:
Probability of that any one node succeeds in slot -3 any one of the transmitting and other
not transmitting in the respective slots
= 3C1P(1-P)2
For choosing one node
= 3P(1-P)2
Answer:B
Q5. What is the probability P3 that the first success occurs in slot 3?
(a) p*(1 - p)^2 (b) 3p*(1 - p)^2
(c) p(1 - p)^2(1 - p(1 - p)^2)^3 (d) (1- (3p(1-p)2)2* 3C1 P(1-P)2

Solution:
Similar concept as of question 18. The difference is that we have to choose any one of the
node here.
Probability = (None of the node succeeds in first 2 slots) *any one of the node
Succeeds in 3rd slots
= (1- (3p(1-p)2)2* 3C1 P(1-P)2
(1-probability of success of any one node)*3C1P(1-P)2
Answer: D
Q6. What is the efficiency E of this three-node system (all nodes succeed)?
(a) p*(1 - p)^2 (b) 3p*(1 - p)^2
(c) p(1 - p)^2(1 - p(1 - p)^2)^3 (d) (1 - p(1 - p)^2)^3

Answer: (b)
Solution:
All node succeeds when no collision occursand no collision occur when only one node
transmits data. So, Probability of that any one node succeeds in slot -3 any one of the
transmitting and other not transmitting in the respective slots
= 3C1P(1-P)2
For choosing one node
= 3P(1-P)2

Data for the next four questions.There are 5 stations in a slotted LAN. Each station attempts to
transmit with aprobability 0.5 in each time slot. Then find probability:
Q7. That exactly one station transmits in a given time slot?_________

Solution: 5𝐶1 * (0.5)4* (0.5) Answer is 0.15625

Q8. That no station transmits in a given time slot?___________

Solution: (1-0.5)5=(0.5)5 = 0.03125 Answer is 0.03125

Q9. That at least two station transmits in a given time slot?___________

Solution: 1-(p(0) +p(1) )

1-((0.5)5+5𝐶1 * (0.5)4* (0.5) ) = 0.8125 Answer is 0.8125
Q10. That all station transmits in a given time slot?___0.03125________

Solution: (0.5)5=0.03125 Answer is 0.03125

Data for the next three questions.Consider the following multiple access schemethatcombines
TDMA and slotted ALOHA. There are 30 users, separated into two groups, one of 4 users and the
other of 26 users. Even time slots (i.e., 0, 2, 4, ...) are reserved for the 4-user group. Odd time slots
(i.e., 1, 3, 5, ...) are reserved for the 26-user group. Contention within each group is resolved by
the slotted ALOHA protocol (e.g., when a user in the 26-user group wants to send, it waits for an
odd slot and then transmits with a probability p).The optimal p is 1/N, where N is the total
number of node in particular group. Assume that every user always has something to send and
in each group the users use the optimal probability
Q11. What is the probability of successful transmission in even slot?
(a) (3/4)3 (b) (1/4)4 (c) (25/26)25 (d) (1/26)26

Solution:
For slotted-ALOHA of N nodes, the throughput is Np[(1 − p)N−1 ], where p is the
transmission probability. The optimal p is 1/N, resulting in throughput of (1 − p)N−1.
The 4-user group and even slots form a 4-node slotted-ALOHA system. Thus its max
throughput is achieved when p = 1/4, and equals 1 − (1/4))3 , which equals (3/4)3.
Answer is (a)
Q12. What is the probability of successful transmission in odd slot?
(a) (3/4)3 (b) (1/4)4 (c) (25/26)25 (d) (1/26)26

Solution:
The 26-user group and odd slots form a 26-node slotted-ALOHA system. Thus, its max
throughput is achieved when p = (1/26), and equals (1 − (1/26))25, which practically equals
1/e.
Answer is (C)
Q13. What is the overall throughput of the system?
(a) [(1/4) + (1/26)26] (b) [(3/4)3 + (25/26)25]
(c) (½)[(1/4)4 + (1/26)26] (d) (½)[(3/4)3 + (25/26)25]

Solution:
Thus the overall throughput is (1/2)[(27/64) + (1/e)].
1/2 is the probability of slot selection.
 Answer is (d)
Q14. Which one of the following is the multiple access protocol for channel access control?
(a) CSMA/CD (b) CSMA/CA (c) both (a) and (b) (d) none of the mentioned

Solution:
CSMA/CD :- Used in Ethernet
CSMA/CA:- used in wifi
Both are used for channel access control
Both are multiple access protocol for channel access control.
Q15. In the _________ method, after the station finds the line idle, it sends its frame
immediately. If the line is not idle, it continuously senses the line until it finds it idle.
(a) non-persistent (b) 1-persistent (c) p-persistent (d) none of the above

Solution:
1-persistent
Answer: B
Q16. In the ________method, a station that has a frame to send senses the line. If the line is idle,
it sends immediately. If the line is not idle, it waits a random amount of time and then
senses the line again.
(a) non-persistent (b) 1-persistent (c) p-persistent (d) none of the above

Solution:
Non-persistent
Answer:A
Q17. Automatic repeat request error management mechanism is provided by
(a) logical link control sub layer (b) media access control sub layer
(c) network interface control sub layer (d) none of the mentioned
Solution:
Automatic repeat request is logical link layer protocol.
Q18. Consider the following statements about the CSMA/CD process is/are true:
 (a) After a collision occurs, devices must synchronize to find a predetermined time to wait
before trying to transmit again.
(b) After a collision occurs, devices independently choose a random time to wait before
trying to transmit again.
(c) The algorithm never permits collisions to happen.
(d) Multiple hosts can transmit data simultaneously.
(e) The hosts must wait until the media is not in use before transmitting.

Solution:
(a) Divide doesnot synchronize in CSMA/CD(False)
(b) TrueDevices chooses a random time to wait before trying to transmit again.
(c) FalseCollision takes place.
(d) True
(e) False
For example

A transmitted some signals (data) it did not reach to. The signals are somewhere in
between media is in used. But when B will sense. It will detect channel as idle as signal
did not reach to B so B will start transmitting.
Hence the statement becomes false.
Answer: (B)&(D)
Q19. Select all correct statement(s) regarding data link layer protocols and MAC sub-layer
protocols.
1. If the physical layer is very reliable and can always provide correct transmission, flow
control will be unnecessary at the data link layer.
2. The MAC sub-layer protocol is to solve channel contention among multiple hosts and
decide who gets to use the channel in a broadcast network.
3. The purpose of a MAC sub-layer protocol is to solve contention among multiple hosts,
 so error control is not required.
(a) 1 and 2 only (b) 2 and 3 only (c) 1 and 3 only (d) 2 only
Solution:
(1) False:-although physical layer is reliable that doesnot mean flow control is not
required at the data link layer.
(2) True:-to solve channel contention among multiple hosts and decide who gets to use
the channel is solved by MAC sub layer protocol.
(3) False:- above mentioned (2ndpt) is function of MAC sub layer protocol that doesnot
mean error control not required .
(4) False:Error, control is still required.
If a packets gets corrupted then we need error control.
Answer:D

Q20. A 1 km long broadcast LAN has 10Mbps (107 bps) bandwidth and uses CSMA/CD. The
signal travels along the wire at 2 × 108 m/s. What is the minimum frame size that can be
used on this network? _________bits
Solution:
tx≥2tp
𝐿 2∗𝐷
≥
𝑅 𝑆
2∗𝐷∗𝑅
L≥
𝑆
2∗𝐷∗𝑅
For minimum L =
𝑆
2∗1000∗10∗106
=
2∗108

L = 100bits
R→Bandwidth
D→Distance
S→ Speed of signal
L →Length of frame in bits
Answer: 100
Q21. What is the minimum frame size of a 1Gbps CSMA/CD LAN with 57 nodes over a wire
 that is 500 meters long? Assume that the speed of light in the medium is 6 microseconds
per Km.
(a) 12Kbits
(b) 6Kbits
(c) 9Kbits
(d) 10Kbits

Solution: 𝑡𝑥 =2tp
: 𝑡𝑝 = 0.5 km * 6
: 𝑡𝑝 =3 microseconds
: 𝑡𝑥 =6 sec
𝐿
=6* 10-6
𝑅

L=6* 10-6 * 109

L= 6000
L=6 kbits.
Answer is B

Q22. Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (10 8 bits per
second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size
required for this network is 1250 bytes, what is the signal speed (km/sec) in the
cable?____________

Solution:
𝑡𝑥 ≥2tp
For min length
𝐿 2∗𝐷
⇒
𝑅 𝑆
2∗𝐷∗𝑅
S≥
𝐿
2∗𝐷∗𝑅
S=
𝐿
2∗1∗100∗106
= = 20,000km/s
1250∗8
 Answer: 20,000
Q23. Suppose the round trip time for a 10 Mbps LAN having 48-bit jamming signal is 46.4μs.
The minimum frame size (in bytes)is:__________

Solution:
The minimum frame size (in bytes) is
L >= (RTT + Tx of jamming signal) x R
L >= (46.4 + 4.8) x 10
L >= 512 bits
L >= 64 bytes
Q24. The following waveform belongs to anIEEE Manchester encoded binary data stream.
Determine the beginning and end of bit periods and give the data sequence.

(a)111010001010 (b)000101110101 (c)000110001010 (d)111001110101

Solution:-

In IEEE Manchester encoding → this indicates 1 (low to righ ) and → this

indicates 0 (high to low )

Answer is A
Q25. How many of the following sequences could be IEEEManchester-coded (where H stands
for “high level” and L for “low level”? You may assume that the sequence starts at the
beginning of a bit.________
(i)LHHLLHLLHL
(ii)HLLHHLHLHL
 (iii)LLHLLHLHHL
(iv)HLLHLHHHLH
(v)HLHLHLHHHL

Q26. Consider a 100 Mbps LAN. Suppose the maximum propagation delay between any two
nodes on the LAN is .512 microseconds. What is the efficiency of this LAN? Assume a
frame length of 64 bytes.___66.67___%

Solution:
Since without knowing LAN standard we can not solve this question. Assume that over LAN standard is
CSMA/CD. Therefor Efficiency is
64∗8
𝑡𝑥 = =5.12
100∗106
𝑡𝑝 .512
a= = =0.1
𝑡𝑥 5.12
1
= =66.67%
1+5∗0.1

Answer is 66.67
Q27. In a circuit switching network, suppose there are 4 hops between two end systems. If the
propagation delay per hop is equal to 0.001 seconds. What is the total propagation delay in
seconds to send a call request signal?
(a) 0.003 (b)0.004 (c)0.005 (d) 0.008

Solution:

here hop means link so 0.01*4=0.04

Answer is B
Q28. [MSQ]
Binary exponential bakeoff is a mechanism used in some MAC protocols. Which of the
following statementsis/are correct?
(a) It ensures that two nodes that experience a collision in a time slot will never collide
with each other whenthey each retry that packet.
(b) It ensures that two or more nodes that experience a collision in a time slot will
experience a lower probability of colliding with each other when they each retry that
packet.
(c) It can be used with slotted Aloha but not with carrier sense multiple access.
(d) Over short time scales, it improves the fairness of the throughput achieved by different
nodes compared tonot using the mechanism.

Solution
(a) false:- It may possible two nodes collision in a time slot may collide in next time slot
(b) true :-probability of colliding of two nodes in the time slot just after the slot in which
they colliding reduces as both nodes select a random no thus reduce chance of collision .
(c) false:- binary exponential back off algorithm used with CSMA/CA ( ethernet LAN)
(d) false:- it is not necessary that it always improves throughput achieved by different
 nodes .
Therefore Option B is true
Answer is B

Q29. [MSQ]
In an CSMA/CD local area network, which one of the following statements is/are TRUE?
(a) A station stops to sense the channel once it starts transmitting a frame.
(b) The purpose of the jamming signal is to pad the frames that are smaller than the
minimum frame size.
(c) A station continues to transmit the packet even after the collision is detected.
(d) The exponential backoff mechanism reduces the probability of collision on
retransmissions.

Solution
(a) False: station doesnot stops sensing the channel once it starts transmitting a frame.
(b) False: jamming signal are send after collision happens.
(c) False:-station stops transmitting frame when collision detected.
(d) True:-exponential backoff mechanism reduces the probability of collision

Answer is D

Q30. A and B are the only two stations on anCSMA/CD LAN. Each has a steady queue
of frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first
backoff race. At the end of this successful transmission by A, both A and B attempt to
transmit and collide. The probability that A wins the second backoff race
is __________(Rounded off to three decimal place)
 Solution:
A B
0 0
0 1
0 2
0 3
1 0
1 1
1 2
1 3
(For A 0-21-1)
0-1
For B 0-22-1
0-3
As second collision of B)
And first collision of A for the respective frame)
5
The probability that A wins the seconds back off race =
8

= 0.625
Answer: 0.625
Q31. A and B are the only two stations on anCSMA/CD LAN. Each has a steady queue of
frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first
backoff race. At the end of this successful transmission by A, both A and B attempt to
transmit and collide. The probability that B wins the second backoff race
is _________(Rounded off to three decimal place)
 Solution:
(same case as for the previous question)
1
Probability that B winds the back off race =
8

= 0.125
Answer: 0.125
Q32. Suppose that a message of size 5000 bits is to be sent through a packet switching network.
What is the required number of packets if the packet size is 1000 bits (of which there are
200 overhead bits)?
(a)8 (b)7 (c)6 (d)5

5000
Solution: 1000-200=800 bit number of packet = ≅6.25=7
800

Answer is B
Q33. We would like to transfer 20KB file across a network from node A to node F. Packets have
a length of 1 KB (neglecting header). The path from node A to node D passes through 3
links, and 2 intermediate nodes. Each of the links is a 10km optical fiber with a rate of 10
Mbps. The 2 intermediate nodes are store-and-forward switches and each intermediate
node must perform a 25 µsec routing table look up after receiving a complete packet before
it can begin sending it on the outgoing link. How long (in msec) does it take to send the
entire file across the network? (Assume the propagation speed through optical fiber is 2 ×
10^8m/sec)._________(Rounded off to two decimal places)

Solution:
Number of packets to transfer is 20KB/1KB = 20 packets.
The per packet transmission time is: TRANSP = (8×210bits)/(1×107bits/sec) = 819.2µsec per
packet.
The per link propagation delay is PROP = (104m)/(2×108m/sec) = 50 µsec
The total transfer time is 20TRANSP + 2TRANSP + 2PROC + 3PROP
= 20 x 819.2 + 2 x 819.2 + 2 x 25 + 3 x 50
= 18.22 ms.
Q34. We would like to transfer 20KB file across a network from node A to node F. Packets have
a length of 1 KB (neglecting header). The path from node A to node D passes through 3
links, and 2 intermediate nodes. Each of the links is a 10km optical fiber with a rate of 10
Mbps. The 2 intermediate nodes are cut – through switches and each intermediate node
must perform a 25 µsec routing table look up after receiving first 200 bits of a packet before
it can begin sending it on the outgoing link. How long (in msec) does it take to send the
entire file across the network? (Assume the propagation speed through optical fiber is 2 ×
108m/sec)._________(Rounded off to two decimal places)

Solution:
Number of packets to transfer is 20KB/1KB = 20 packets.
The per packet transmission time is: TRANSP = (8×210bits)/(1×107bits/sec) = 819.2µsec per
packet.
With cut-through the switch delays the packet by 200 bits, this means a cut-through delay
of= (200/1×107bits/sec) s = 20 µsec
The per link propagation delay is PROP = (104m)/(2×108m/sec) = 50 µsec
The total transfer time is 20TRANSP + 2 TRANSP of cut through + 2PROC + 3PROP
= 20 x 819.2 + 2 x 20 + 2 x 25 + 3 x 50
= 16.624ms.
Data for the next two questions.The figure below illustrates a switched network. Consider a
message that is 7.5 ∗ 106 bits long to be sent from the source to the destination. (Assume header
size is negligible relative to the entire message size). Suppose each link is 1.5 Mbps. Focus on
transmission delays only and assumes all other delay components are negligible.Assume that each
switch uses store-and-forward packet switching.

Q35. Consider sending the message from source to the destinationwithout message
segmentation. How long (in sec) does it take to move themessage from the source host to
the destination host?
 Solution:
Time to transmit on single hop = 7.5 x 106/1.5 x 106 = 5 sec.
Total delay = 5 sec x 3 hops = 15 sec.
Answer is 15
Q36. Now suppose that the message is segmented into 5000packets, with each packet being
1500 bits long.How long (in sec) does it take to move the file from source host
todestination host when message segmentation is used?

Solution:
Time at which the first packet is received at the destination host is 3 msec. After this, every
1 msec one packet will be received; thus,timeout which the last or 5000th packet is
received is 3msec + 49999 * 1msec= 5.002 sec.
Answer is 5.002
Q37. Circuit switching is more efficient than packet switching because
(a) All participating routers figure out the route just once at the start of a communication
session.
(b) It uses the bandwidth of the network more efficiently.
(c) It is done in hardware instead of software.
(d) It is a data link versus a network layer protocol.

Solution
(a)In circuit switching All paths required for communicationis already figure out before
transmitting. So true.
(b) no circuit switched network not uses bandwidth more efficiently.
(c) false,can be done in both.
(d) It is not a protocol like ICMP, ARP, etc
Answer is A

Q38. [MSQ]
Packet switching is/are more efficient than circuit switching because
 (a) All participating routers figure out the route just once at the start of a communication
session.
(b) It uses the bandwidth of the network more efficiently.
(c) It is done in hardware instead of software.
(d) It uses store-and-forward packet delivery through routers.
Solution
(a) False: In circuit switching all route are predetermine before staring communication.
(b) True as there is property of packet switching it allows users to equally share bandwidth
resources, thus uses bandwidth more effectively.
(c) False can be done in software
(d) false
Answer is B

Data For the next two questions. Assume the topology presented below, where nodes A and B
are end hosts.

Q39. Assume every link between the end hosts has a transmission rate of 100 Mbps and can
handle up o 20 simultaneous circuits. Nodes A and B establish a circuit switching
connection. What will be their maximum transmission rate per connection?

Solution: Their maximum transmission rate will be 100Mbps/20 = 5Mbps.

Q40. Now assume that packet switching is being used. If end hosts A and B are sending
messages on an otherwise idle network, what will be their transmission rate per
connection?

Solution: Their transmission rate will be 100Mbps

Data for the next two questions. Find the total delay in sending 10000 bits of user data over a 5-
hop path in a circuit-switched network and a packet-switched network. Here, the total delay is
defined to be the time from the data starts to be delivered to the network till all the data bits have
been received at the end of the path. For the packet-switched network, it is assumed that the
network is lightly loaded and the queuing delay at each switching node is ignored, and in
addition, the packet header size is ignored. For both networks, there is no loss. The circuit setup
time is 10microsecond, the propagation delay is 25microsecond per hop, each packet contains
1000 data bits, and the bit rate of the line on each hop is 100Mbps.
Q41. What is the total delay (in microseconds), if the message is sent over the circuitswitched
network? ___________

Solution

Circuit setup time =10us

As 10000 bits =user data
Packet size =1000 bits
10000
Tx for data = R =100x106 and in circuit switching whole data is send
100𝑥106

tp (per hop)=25us
5 hop=25x5=125 us
Total delay =tx+5x+tp+circuit setup time
=100+5x25+10= 235 us
Answer is :235

Q42. What is the total delay (in microseconds), if the message is sent over the packetswitched
network? _____265_______
Solution

As in packet switched , no circuit setup time will be there +data is sent packets
10000
No .of packets = =10 packet
1000

tx of packet =10us
total delay =10tx+4*tx+5xtp
 =10*10+4*10+5*25
265 us
Answer is 265

For next two questions consider the following diagram of an LAN network

Q43. Assume switch A and switch B both have empty switching tables to start with.Host Z
sends a packet to host W. Which hosts receive the packet?
(a) V, W, X and Y receive the packet
(b) V, X and Y receive the packet
(c) W, X and Y receive the packet
(d) Switch B discards the packet
Solution
As both switch do not have entry in there table both switch broadcast packet sent by z thus
host V,W,X and Y all receive packet answers :-A
Answer is A
Q44. Assume switch A and switch B now have switching tables corresponding to immediately
after the packet in the previous question was received. Host X sends a packet to host Z.
Which hosts receive the packet?
(a) W, V and Z receive the packet
(b) W and Z receive the packet
(c) Y, Wand Z receive the packet
(d) V, W, Y and Z receive the packet
Solution:
 As switch knows where A is best host x first sends packet to host B and HUB is
broadcasting device thus host w will receive packet along with switch A.
now switch B receives packet and it now contains entry of Z (previous question ) thus
selectively forwarding to host Z. w and z will receivepacket.
Ans :-B

Q45. [MSQ]
When segmenting a LAN, whichof the following devices can be used to reduce the
collision domain?
I. Bridge
II. Switch
III. Router
IVHub
(a) I only (b) II and III only
(c) I and III only (d)I and II only

Answer is (I)(II)(III) (a,b,c)

Solution:- Router, bridge and switch, reduces collisiondomain
Q46. Which of the following statements about network components is true?
(a)A bridge connects two segments. A switch can provide a direct connection to a station.
Repeaters and hubs do not reduce network traffic congestion
(b) A hub is a multi-port repeater. A bridge can chose to discard certain frames; a switch
receives incoming frames and forwards them to all outgoing ports.
(c)Both bridges and switches build tables to determine where to route traffic. Hubs can be
used to reduce network congestion. Repeaters allow a network to be physically extended.
(d) Repeaters regenerate a signal. A bridge forwards all packets on all its outgoing ports. A
hubswitches packets between station

Ans: A
(a) All mentioned statements are properties of the given devices. true
(b) False although a hub is multiport repeater but bridge can`t choose to discard frame
 it forwards frame to all outgoing lines except the line from where frame came
switch perform selective forwarding thus false .
(c) False , bridge reason already mentioned in option b
(d) False hub doesn’t switched between stations.

Q47. [MSQ]
Which of the following statements about OSI Layer 2 switches is/are true?
(i) Layer 2 switches prevent broadcasts
(ii) Layer 2 switches have multiple collision domains
(iii) Layer 2 switches route traffic between different networks
(iv) Layer 2 switches decrease the number of broadcast domains
(v) Layer 2 switches can send traffic based on the destination MAC address

Answer is (II)&(V)
Solution
(i) false :Layer 2 devices doesnot prevent broadcasts bridges.
(ii) true :can have multiple collision domain domains
(iii) false :router , route traffic between different networks and router is layer -3 device
(iv) false: switches reduces number of collision domains not broadcast domain
(v) true :switches it Layer 2 device use MAC address
Q48. What is the name for the devices in the cloud in the diagram?

(a) Switches (b) Routers (c) Hubs (d) Repeaters

Ans :- Switch is layer -2 device use MAC address .

Q49. Adding a switch/bridge in a LAN will
(a) Increases the number of broadcast domains, but decreases the size of each broadcast
domain.
(b) Decreases the number of broadcast domains, but increases the size of each broadcast
domain.
(c) Increases both the number of broadcast domains as well as the size of each broadcast
domain.
(d) Decreases both the number of broadcast domains as well as the size of each broadcast
domain.

Ans :-a
Switch increases number of broadcast domains but decreases size of each broadcast
domain therefore option A is true

Q50. Consider an n-port hub, n-port switch and n-port router. The number of broadcast domain
in hub , switch and router respectively is
(a) 1, 1, 1
(b) 1, 1, n
(c) 1, n, n
(d) n, n, n

Ans :-b
No of broadcast domain in
Hub=1
Switch =1
router = no of outgoing lines
 1 1 n is correct answer
Q51. Consider an n-port hub, n-port switch and n-port router. The number of collision cast
domain in hub , switch and router respectively is
(a) 1, 1, 1
(b) 1, 1, n
(c) 1, n, n
(d) n, n, n

Ans :- c
No of collision domain in hub=1
Switch =no of outgoing lines
Router =no.of outgoing lines
 1 n n is correct answers

Q52. In the following diagram, how many collision domains are there?______________

Answers :-8
No of collision domain of switch ,bridge= no. of outgoing lines it is same for router also
no of collision domain of hub =1
1stcollision domain bridge 1 line ,n/w that contains HUB 1 and device A,B,C,D,E
2ndcollision domain link b/w bridge 1 and switch 1
3rdcollision domain = switch 1 –device I
4thcollision domain = switch 1 –device k
5thcollision domain = switch 1 –device M
6thcollision domain = link b/w switch 1 –bridge 2
 7thcollision domain = bridge 2 link having devices E,G,H
8thcollision domain = link b/w bridge -2 router -1
Total 8 collision domain will be there

Q53. In the following diagram, how many broadcast domains are there?______________

Answers (-2)
Switch and bridge have 1 broadcast domain Router = no of outgoing line
1st broadcast domain (part 2) Bridge 2 –router 2nd broadcast domain contains remaining
switches bridges and devices
2 broadcast domain are there

Q54. Consider destinations connected to a single source by a binary tree of routers as shown
below (the source is the node at the top). Each time a packet (or copy of a packet) is sent
over a single link, it incurs a unit of cost. In a single time step, a node can receive all
transmitted broadcast packets from its neighbors, duplicate the packets, and send them to
all of its neighbors (except to the node that sent a given packet).At the next time step,
neighboring nodes can receive, duplicate, and forward these packets, and so on.

Assume that uncontrolled flooding is used to provide broadcast in this network. At time
step k, how many copies of the broadcast packet will be transmitted, assuming that during
time step 1, a single broadcast packet is transmitted by the source node to its three
neighbors?
(a) 3 * 2k-1 (b) 2 * 2k (c) 3 * 2k-1 (d) 3 * 3k-1

At first time stamp packet will send to 3-nodes then: in 2nd time stamp packet will send to 3x2 nodes. For 3rd
time stamp packet will send to 3x2x2 nodes.
Them , for kth Time Stamp Packet Will send to 3x2x2x----k-1 nodes i.e 3x2(k-1) nodes.