Which statement is correct about IS-IS when it performs the Dijkstra algorithm?

Question

Options

• AThe local router moves its own local tuples into the candidate database.
• BWhen a new neighbor ID in the tree database matches a router ID in the LSDbthe neighbor ID is moved to the candidate database.
• CTuples with the lowest cost are moved from the tree database to the LSDB.
• DThe algorithm will stop processing once the tree database is empty.

• A
  4% (1)
• B
  79% (19)
• C
  4% (1)
• D
  13% (3)

Explanation

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

No community discussion yet for this question.