- Home
- Networking
- CCNA Routing and Switching 200-105
31.
Which of the following routing protocols is considered to use link-state logic?
- A.RIPv1
- B.RIPv2
- C.EIGRP
- D.OSPF
- Answer & Explanation
- Report
Answer : [D]
Explanation :
Explanation :
| Both versions of RIP use distance vector logic, and EIGRP uses a different kind of logic, characterized either as advanced distance vector or a balanced hybrid. |
32.
Which of the following routing protocols use a metric that is, by default, at least partially affected by link bandwidth? (Choose two answers.)
- A.RIPv1
- B.RIPv2
- C.EIGRP
- D.OSPF
- Answer & Explanation
- Report
Answer : [C and D]
Explanation :
Explanation :
| Both versions of RIP use the same hop-count metric, neither of which is affected by link bandwidth. EIGRP’s metric, by default, is calculated based on bandwidth and delay. OSPF’s metric is a sum of outgoing interfaces costs, with those costs (by default) based on interface bandwidth. |
33.
Which of the following interior routing protocols support VLSM? (Choose three
answers.)
- A.RIPv1
- B.RIPv2
- C.EIGRP
- D.OSPF
- Answer & Explanation
- Report
Answer : [B],[C],(D)
Explanation :
Explanation :
| Of the listed routing protocols, only the old RIP Version 1 (RIP-1) protocol does not support variable-length subnet masks (VLSM). |
34.
Two routers using OSPFv2 have become neighbors and exchanged all LSAs. As a
result, Router R1 now lists some OSPF-learned routes in its routing table. Which
of the following best describes how R1 uses those recently learned LSAs to choose
which IP routes to add to its IP routing table?
- A.Each LSA lists a route to be copied to the routing table.
- B.Some LSAs list a route that can be copied to the routing table.
- C.Run some SPF math against the LSAs to calculate the routes.
- D.R1 does not use the LSAs at all when choosing what routes to add.
- Answer & Explanation
- Report
Answer : [C]
Explanation :
Explanation :
| LSAs contain topology information that is useful in calculating routes, but the LSAs do not directly list the route that a router should add to its routing table. In this case, R1 would run a calculation called the Shortest Path First (SPF) algorithm, against the LSAs, to determine what IP routes to add to the IP routing table. |
35.
Which of the following OSPF neighbor states is expected when the exchange of
topology information is complete between two OSPF neighbors?
- A.2-way
- B.Full
- C.Up/up
- D.Final
- Answer & Explanation
- Report
Answer : [B]
Explanation :
Explanation :
| Neighboring OSPF routers that complete the database exchange are considered fully adjacent and rest in a full neighbor state. The up/up and final states are not OSPF states at all. The 2-way state is either an interim state or a stable state between some routers on the same VLAN. |
|
|
||||||||||||||||||||||||||||
