Access Algorithm MCQs : This section focuses on the "Access Algorithm". These Multiple Choice Questions (MCQs) should be practiced to improve the Access Algorithm skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.
Question 1
A local area network can be used to interconnect
A. Computers
B. Terminals
C. Printers
D. All of the mentioned
Question 2
As channel capacity increases, channel throughput
A. Increases
B. Decreases
C. Remains the same
D. None of the mentioned
Question 3
Binary tree search is used for
A. Multiple users
B. Single users
C. Single & Multiple users
D. None of the mentioned
Question 4
For a higher throughput value which method works efficiently?
A. S-ALOHA
B. Pure ALOHA
C. R-ALOHA
D. None of the mentioned
Question 5
For a throughput of value less than 0.20, which has less average delay?
A. S-ALOHA
B. Pure ALOHA
C. R-ALOHA
D. None of the mentioned
Question 6
For a throughput value of 0.20 to 0.67, which has less average delay?
A. S-ALOHA
B. Pure ALOHA
C. R-ALOHA
D. None of the mentioned
Question 7
In Aloha technique, the re-transmission takes place immediately.
A. TRUE
B. FALSE
Question 8
In which technique, packet size are constant?
A. Pure Aloha
B. Slotted Aloha
C. Pure & Slotted Aloha
D. None of the mentioned
Question 9
LAN uses _________ cables.
A. Low bandwidth
B. High bandwidth
C. Low & High bandwidth
D. None of the mentioned
Question 10
The interface between the ring and the stations are passive.
A. TRUE
B. FALSE
Question 11
The maximum packet size of Ethernet is
A. 1426 bytes
B. 1526 bytes
C. 1256 bytes
D. 1626 bytes
Question 12
The minimum packet size of Ethernet is
A. 81 bytes
B. 75 bytes
C. 72 bytes
D. 64 bytes
Question 13
Which method is better suited for large population?
A. Straight polling
B. Binary tree search
C. Straight polling & Binary tree search
D. None of the mentioned