subject

Connect Network Devices You're a network technician for a small corporate network. The company recently expanded to the second floor of its building. You've already installed a small networking closet on the second floor, and you've run the necessary cables to the ports on each of the floor's fiber patch panels. Now, you need to connect the two networks using fiber optic cables.
In this lab, your task is to connect the switch in the Networking Closet on Floor 1 with the switch in Networking Closet 2 on Floor 2 through the fiber patch panels in each networking closet. Use the following information to identify the necessary connections:
Connect the appropriate fiber cable to switches through the fiber patch panels.
For the patch panel on Floor 1:
Port 3 is transmit (Tx).
Port 4 is receive (Rx).
For the patch panel on Floor 2:
Port 1 is transmit (Tx).
Port 2 is receive (Rx).
Use the color coding on the end of fiber optic cables to identify which end is Tx and which is Rx.
Connector A (white or red) is Tx.
Connector B (black) is Rx.
Plug the switch on Floor 2 into a bank 1 critical load outlet on the UPS.
Verify the connection was made by checking the internet connection on any Floor 2 computer.
When you connect fiber optic cables, the transmit (Tx) port on one device is connected to the receive (Rx) port on the other device. The fiber cables in this lab have already had their Rx and Tx connectors switched as necessary. You can view component information in the Details window on the Specification tab.

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 23:30
Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.
Answers: 3
question
Computers and Technology, 22.06.2019 19:30
When using a public computer or network, you should always
Answers: 2
question
Computers and Technology, 23.06.2019 00:30
Write the html code to make a link out of the text “all about puppies”. it should link to a pdf called “puppies.pdf” inside the “documents” folder. the pdf should open in a new window.
Answers: 2
question
Computers and Technology, 24.06.2019 02:30
How to apply the fly in effect to objects on a slide
Answers: 1
You know the right answer?
Connect Network Devices You're a network technician for a small corporate network. The company rece...
Questions
Questions on the website: 13722367