Differentiate full-duplex from half-duplex.
No Answer is Posted For this Question
Be the First to Post Answer
What is the second best path name of eigrp?
Which table find best path?
Which command we use for ping in ipv6?
What are the protocol data units (pdu) in ccna?
Identify the true statement regarding subnetting? A.) Allows for more host address B.) Borrow bits from the network portion of the address C.) Allows for unlimited number of networks D.) Borrow bits from the host portion of the address
Identify the definition of demarcation? A.) Date in which the WAN service contract expires B.) Cabling which extends from the WAN service provider to the customer C.) Division of responsibility, where the CPE ends and the local loop begins D.) Equipment which is located at the customer premises
Identify the 2 commands that save the running-config to a TFTP server? A.) write running tftp B.) copy running network C.) copy running tftp D.) write network
Identify the command to configure DLCI 100 on an interface e0? A.) Router(config)# frame-relay local-dlci 100 B.) Router(config)# frame-relay local-dlci 100 int e0 C.) Router(config-if)# frame-relay local-dlci 100 D.) Router(config-if)# frame-relay local-dlci 100 int e0
Write out a config to permit only the below MAC address to pass traffic through a port on your switch. mac-address 0005.1b00.5b58
In distance-vector routing, there is a problem known as the 'count to infinity' problem. What is the most direct solution to this? A.) Defining a Maximum. B.) You can not solve the 'count to infinity' problem with a distance vector protocol. C.) Poison Reverse. D.) Triggered Updates. E.) Split Horizon.
Dear Mr.Shahin thank you very much for your advise i realy thanks full to you. Best of luck
Which of the following are solutions to the problems encountered with Distance-Vector routing? A.) Defining a Maximum B.) Poison Reverse C.) Triggered Updates D.) Shortest path first algorithm. E.) Split Horizon