In this section of Data Communication and Networking – Multiple Access MCQ (Multiple Choice) Based Questions and Answers,it cover the below lists of topic. All the Multiple Choice Questions and Answers (MCQs) have been compiled from the book of Data Communication and Networking by The well known author behrouz forouzan.
This Section covers below lists of topics.
- Point-to-Point Protocol (PPP) MCQs.
- Link Control Protocol (LCP) MCQs.
- Password Authentication Protocol (PAP) MCQs.
- Challenge Handshake Authentication Protocol (CHAP) MCQs.
- Network Control Protocol (NCP) MCQs.
- Internetwork Protocol Control Protocol (IPCP) MCQs
1. We have categorized access methods into _______ groups.
- two
- three
- four
- five
B. three
2. In ___________ methods, no station is superior to another station and none is assigned the control over another
- random access
- controlled access
- channelization
- none of the above
A. random access
3. In ______, the chance of collision can be reduced if a station senses the medium before trying to use it.
- MA
- CSMA
- FDMA
- CDMA
B. CSMA
4. _______ requires that each station first listen to the medium before sending.
- MA
- CSMA
- FDMA
- CDMA
B. CSMA
5. __________ augments the CSMA algorithm to detect collision
- CSMA/CA
- CSMA/CD
- either (a) or (b)
- both (a) and (b)
B. CSMA/CD
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
- CSMA/CA
- CSMA/CD
- either (a) or (b)
- both (a) and (b)
B. CSMA/CD
7. To avoid collisions on wireless networks, ________was invented.
- CSMA/CA
- CSMA/CD
- either (a) or (b)
- both (a) and (b)
A. CSMA/CA
8. 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)
A. CSMA/CA
9. In _______ methods, the stations consult one another to find which station has the right to send
- random access
- controlled access
- channelization
- none of the above
B. controlled access
10. In _______ methods, a station cannot send unless it has been authorized by other stations.
- random access
- controlled access
- channelization
- none of the above
B. controlled access
11. We discussed ______ popular controlled-access methods
- two
- three
- four
- none of the above
B. three
12. In the ________ method, a station needs to make a reservation before sending data. Time is divided into intervals.
- reservation
- polling
- token passing
- none of the above
A. reservation
13. In the _____ method, time is divided into intervals. In each interval, a reservation frame precedes the data frames sent in that interval.
- reservation
- polling
- token passing
- none of the above
A. reservation
14. In the ______ method, all data exchanges must be made through the primary device even when the ultimate destination is a secondary device.
- reservation
- polling
- token passing
- none of the above
B. polling
15. In the _______ method, the primary device controls the link; the secondary devices follow its instructions.
- reservation
- polling
- token passing
- none of the above
B. polling
16. In the _______ method, the stations in a network are organized in a logical ring.
- reservation
- polling
- token passing
- none of the above
C. token passing
17. In the _______ method, each station has a predecessor and a successor
- reservation
- polling
- token passing
- none of the above
C. token passing
18. In the _________ method, a special packet called a ______ circulates through the ring.
- reservation: control frame
- polling: poll request
- token passing: token
- none of the above
C. token passing: token
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
- Random access
- Controlled access
- Channelization
- none of the above
C. Channelization
20. We discussed ________ channelization protocols
- two
- three
- four
- none of the above
B. three
21. In ________, the available bandwidth is divided into frequency bands.
- FDMA
- TDMA
- CDMA
- none of the above
A. FDMA
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.
- FDMA
- TDMA
- CDMA
- none of the above
A. FDMA
23. In _______, the stations share the bandwidth of the channel in time.
- FDMA
- TDMA
- CDMA
- none of the above
B. TDMA
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.
- FDMA
- TDMA
- CDMA
- none of the above
B. TDMA
25. In _____, each station transmits its data in its assigned time slot
- FDMA
- TDMA
- CDMA
- none of the above
B. TDMA
26. In ________ each station sends a frame whenever it has a frame to send.
- pure ALOHA
- slotted ALOHA
- both (a) and (b)
- neither (a) nor (b)
A. pure ALOHA
27. In ______, the stations use different codes to achieve multiple access.
- FDMA
- TDMA
- CDMA
- none of the above
C. CDMA
28. In pure ALOHA, the vulnerable time is ______ the frame transmission time.
- the same as
- two times
- three times
- none of the above
B. two times
29. _______ is based on coding theory and uses sequences of numbers called chips
- FDMA
- TDMA
- CDMA
- none of the above
C. CDMA
30. The maximum throughput for pure ALOHA is ________ per cent.
- 12.2
- 18.4
- 36.8
- none of the above
B. 18.4
31. In _______, the sequences are generated using orthogonal codes such the Walsh tables
- FDMA
- TDMA
- CDMA
- none of the above
C. CDMA
32. In __________, each station is forced to send only at the beginning of the time slot
- pure ALOHA
- slotted ALOHA
- both (a) and (b)
- neither (a) nor (b)
B. slotted ALOHA
33. In slotted ALOHA, the vulnerable time is ______ the frame transmission time.
- the same as
- two times
- three times
- none of the above
A. the same as
34. The maximum throughput for pure ALOHA is ________ per cent.
- 12.2
- 18.4
- 36.8
- none of the above
C. 36.8
35. The vulnerable time for CSMA is the ________propagation time.
- the same as
- two times
- three times
- none of the above
A. the same as
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.
- nonpersistent
- 1-persistent
- p-persistent
- none of the above
B. 1-persistent
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.
- nonpersistent
- 1-persistent
- p-persistent
- none of the above
A. nonpersistent
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
- nonpersistent
- 1-persistent
- p-persistent
- none of the above
C. p-persistent