Transmitters 11. In a wireless networks, transmitters A and B both want to transmit to a receiver, C. A and B are out of range of each other. Both A and B are in range of C for transmitting and receiving. This is an example of A) hidden terminal problem (B) exposed terminal problem (C) None of the above 12. In switched Ethernet all stations that are connected by a hub are in the same collision domain. (A) True (8) False 13. In Classic Ethernet all stations are in the same collision domain. (A) True (B) False 14. Draw a line to match the encoding to the feature NRZ Manchester 8B/10B Provides some clock signal and no DC component (balanced) Provides clock signal but may have a DC component Provides neither Clocking or balance 15. Would a Voice call (VOIP) where quality is a concern be more appropriate for a connection oriented or connectionless network? (A) Virtual-Circuit (B) Datagram (C) Dijkstra (D) static (E) none of the above 16. The optimal path between a router in New York and a router in California, includes a router in Indiana. Therefore, according to the optimality principal, the optimal path between New York and Indiana is on the same path as the California route (A) True (B) False (C) Cannot determine (D) Possibly 17. In a network, Djkstra's algorithm is computed to determine the optimal routing paths. These ths are loaded into the routers when they are set up, and never change. This is an example pa of: (A) static routing (8) adaptive routing Routing algorithms may require a "cost" between nodes. Cost is a measure of (A) hops (8) throughput (C) bandwidth (D) possibly all of the above (E) none of the above 18. 9. In a flood routing algorithm, packets are forwarded to all ports always (A) True (B) False 20. Networks that use Distance Vector Routing are slow to heal (A) True (B) False