Exam 9: Introduction to Metropolitan Area Networks and Wide Area Networks
Exam 1: Introduction to Computer Networks and Data Communications76 Questions
Exam 2: Fundamentals of Data and Signals100 Questions
Exam 3: Conducted and Wireless Media103 Questions
Exam 4: Making Connections79 Questions
Exam 5: Making Connections Efficient: Multiplexing and Compression96 Questions
Exam 6: Errors, Error Detection, and Error Control75 Questions
Exam 7: Local Area Networks: Part I99 Questions
Exam 8: Local Area Networks: Part II113 Questions
Exam 9: Introduction to Metropolitan Area Networks and Wide Area Networks101 Questions
Exam 10: The Internet100 Questions
Exam 11: Voice and Data Delivery Networks97 Questions
Exam 12: Network Security100 Questions
Exam 13: Network Design and Management99 Questions
Select questions type
All wide area networks are collections of at least two basic types of equipment: a station and a ____.
(Multiple Choice)
5.0/5
(40)
A local area network works as a ____ network in that clusters of workstations are connected to a central point (hub or switch) through which workstations can transmit messages to one another.
(Multiple Choice)
4.9/5
(36)
Compared to Dijkstra's least-cost routing algorithm, the flooding technique seems more complex.
(True/False)
4.8/5
(39)
Many of the same technologies and communications protocols found in local area networks are used to create metropolitan area networks.
(True/False)
5.0/5
(48)
Local area network Ethernet allows users to set their own data transfer rates.
(True/False)
4.9/5
(39)
SONET rings typically have a failover time of ____ milliseconds.
(Multiple Choice)
4.7/5
(40)
____________________ is a data transfer service that can connect your business to another business (or businesses) using a standard Ethernet connection.
(Short Answer)
4.8/5
(31)
The speed at which a failover is performed is the ____________________.
(Short Answer)
5.0/5
(37)
A classic algorithm that calculates a least-cost path through a network is ____ algorithm.
(Multiple Choice)
4.8/5
(40)
You can assign many meanings to the weights in a weighted network graph.
(True/False)
4.8/5
(36)
Ciccuit-switched networks will someday replace packet-switched networks.
(True/False)
4.9/5
(50)
In a network graph, the edge between each pair of nodes can be assigned a weight or associated cost to form a structure called a(n) _________________________.
(Short Answer)
4.8/5
(42)
In a(n) ____________________ network, all data messages are transmitted using fixed-sized packages, called packets, and no unique, dedicated physical path is established to transmit the data packets across the subnetwork.
(Short Answer)
4.8/5
(33)
Almost all MANs are based on one of two basic forms of supporting technology: ____ or Ethernet.
(Multiple Choice)
4.7/5
(31)
When a node on a wide area network ____ network transmits its data, the data is received by all the other nodes.
(Multiple Choice)
4.8/5
(49)
When routing tables adapt to network changes, the routing system is called ____.
(Multiple Choice)
4.9/5
(30)
When a network or a part of a network becomes so saturated with data packets that packet transfer is noticeably impeded, ____ occurs.
(Multiple Choice)
4.7/5
(38)
Showing 81 - 100 of 101
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)