nerdexam
Juniper

JN0-664 · Question #3

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.)

The correct answer is B. The Shortest Path First algorithm must prune looped paths. D. All nodes within an area must have the same information in their LSDBs. You've hit your limit · resets 4am (America/New_York)

MPLS Core Technologies

Question

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.)

Options

  • AThe DR/BDR ensures that each node within an area has the same information in their LSDBs.
  • BThe Shortest Path First algorithm must prune looped paths.
  • CNodes within an area must connect in a full mesh.
  • DAll nodes within an area must have the same information in their LSDBs.

How the community answered

(33 responses)
  • A
    3% (1)
  • B
    94% (31)
  • C
    3% (1)

Explanation

You've hit your limit · resets 4am (America/New_York)

Topics

#OSPF#SPF algorithm#LSDB#loop prevention

Community Discussion

No community discussion yet for this question.

Full JN0-664 Practice