EI8751-IDN-Unit 1-1.8-Quiz-CSMA/CD

What is the name of the algorithm used in CSMA/CD networks in order to avoid repeated collisions?

• collision avoidance

• crash prevent

• exponential back-off

• exponential collisions

CSMA stands for

• Carrier Sense Multiple Access

• Carrier Sense Multiple Association

• Current Sense Multiple Access

• Carrier Sense Mutually Access

The vulnerable time for CSMA is the ________propagation time

• two times

• the same as

• three times

• none of the above

The vulnerable time for CSMA is the same as propagation time.

________ requires that each station first listen to the medium before sending

• MA

• CSMA

• CDMA

• FDMA

__________ augments the CSMA algorithm to detect collision.

• CSMA/CA

• CSMA/CD

• either (a) or (b)

• both (a) and (b)

In ________, a station monitors the medium after it sends a frame to see if the transmission was successful. If so, the station is finished. If, however, there is a collision, the frame is sent again.

• CSMA/CA

• CSMA/CD

• either (a) or (b)

• both (a) and (b)

To avoid collisions on wireless networks, ________was invented

• CSMA/CA

• CSMA/CD

• either (a) or (b)

• both (a) and (b)

In _______, collisions are avoided through the use of three strategies: the interframe space, the contention window, and acknowledgments.

• CSMA/CA

• CSMA/CD

• either (a) or (b)

• both (a) and (b)

Which is not the CSMA protocol?

• 1-Persistent CSMA

• Non-Persistent CSMA

• P-Persistent CSMA

• x-Persistent CSMA

Which statement is true about 1-persistent CSMA protocol?

• 1-persistent because the host transmits with a probability of 1

• Its probability is 1 whenever it finds the channel idle

• It has always 1 probability either channel is in idle condition or not.

• Both (1) and (2)