LAN and Access Algorithm Techniques

Digital Communications Systems

This set of Digital Communications Multiple Choice Questions & Answers (MCQs) focuses on “Multiple access techniques for LAN and access algorithms”.

1. A local area network can be used to interconnect
a) Computers
b) Terminals
c) Printers
d) All of the mentioned

2. LAN uses _________ cables.
a) Low bandwidth
b) High bandwidth
c) Low & High bandwidth
d) None of the mentioned

3. The maximum packet size of Ethernet is
a) 1426 bytes
b) 1526 bytes
c) 1256 bytes
d) 1626 bytes

4. The minimum packet size of Ethernet is
a) 81 bytes
b) 75 bytes
c) 72 bytes
d) 64 bytes

5. The interface between the ring and the stations are passive.
a) True
b) False

6. Bit stuffing is done by inserting _____, after ____ consecutive ones.
a) Zero, seven
b) Zero, five
c) One, seven
d) One, five

7. As channel capacity increases, channel throughput
a) Increases
b) Decreases
c) Remains the same
d) None of the mentioned

8. In Aloha technique, the re-transmission takes place immediately.
a) True
b) False

9. In which technique, packet size are constant?
a) Pure Aloha
b) Slotted Aloha
c) Pure & Slotted Aloha
d) None of the mentioned

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

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

12. Binary tree search is used for
a) Multiple users
b) Single users
c) Single & Multiple users
d) None of the mentioned

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

14. For a higher throughput value which method works efficiently?
a) S-ALOHA
b) Pure ALOHA
c) R-ALOHA
d) None of the mentioned

Leave a Reply

Your email address will not be published. Required fields are marked *