You want to ensure that a single-area OSPF network will be loop free. In this scenario, what are two requirements that satisfy this requirement? (Choose two.)
A.
The DR/BDR ensures that each node within an area has the same information in their LSDBs.
B.
The Shortest Path First algorithm must prune looped paths.
C.
Nodes within an area must connect in a full mesh.
D.
All nodes within an area must have the same information in their LSDBs.
Answer:
ad
User Votes:
A
50%
B 1 votes
50%
C
50%
D 1 votes
50%
Discussions
0/ 1000
uax
1 month ago
b) and d) are correct. dr/bdr not dealing with loop-free
Want to join our community?
Please log in or signup in order to use this feature
b) and d) are correct. dr/bdr not dealing with loop-free