Data Communication and Networking – Multiple Access MCQs

1. We have categorized access methods into _______ groups.

2. In ___________ methods, no station is superior to another station and none is assigned the control over another

3. In ______, the chance of collision can be reduced if a station senses the medium before trying to use it.

4. _______ requires that each station first listen to the medium before sending.

5. __________ augments the CSMA algorithm to detect collision

6. 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

7. To avoid collisions on wireless networks, ________was invented.

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

9. In _______ methods, the stations consult one another to find which station has the right to send

10. In _______ methods, a station cannot send unless it has been authorized by other stations.

11. We discussed ______ popular controlled-access methods

12. In the ________ method, a station needs to make a reservation before sending data. Time is divided into intervals.

13. In the _____ method, time is divided into intervals. In each interval, a reservation frame precedes the data frames sent in that interval.

14. In the ______ method, all data exchanges must be made through the primary device even when the ultimate destination is a secondary device.

15. In the _______ method, the primary device controls the link; the secondary devices follow its instructions.

16. In the _______ method, the stations in a network are organized in a logical ring.

17. In the _______ method, each station has a predecessor and a successor

18. In the _________ method, a special packet called a ______ circulates through the ring.

19. _______ is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code, between different stations

20. We discussed ________ channelization protocols

21. In ________, the available bandwidth is divided into frequency bands.

22. In ______, each station is allocated a band to send its data. In other words, each band is reserved for a specific station, and it belongs to the station all the time.

23. In _______, the stations share the bandwidth of the channel in time.

24. In _____, each station is allocated a time slot during which it can send data. Each station transmits its data in its assigned time slot.

25. In _____, each station transmits its data in its assigned time slot

26. In ________ each station sends a frame whenever it has a frame to send.

27. In ______, the stations use different codes to achieve multiple access.

28. In pure ALOHA, the vulnerable time is ______ the frame transmission time.

29. _______ is based on coding theory and uses sequences of numbers called chips

30. The maximum throughput for pure ALOHA is ________ per cent.

31. In _______, the sequences are generated using orthogonal codes such the Walsh tables

32. In __________, each station is forced to send only at the beginning of the time slot

33. In slotted ALOHA, the vulnerable time is ______ the frame transmission time.

34. The maximum throughput for pure ALOHA is ________ per cent.

35. The vulnerable time for CSMA is the ________propagation time.

36. 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.

37. 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.

38. In the _______method, after the station finds the line idle it sends or refrain from sending based on the outcome of a random number generator. If the line is busy, it tries again