What does partial route computation (PRC) optimize in IS-IS?

It reduces the number of LSPs sent during flooding

It recomputes only the affected routes when a leaf changes, without full SPF

It calculates the shortest path tree for each router independently

It computes routes for only a subset of the area

What is the purpose of incremental SPF (iSPF) in IS-IS?

To reduce the number of LSPs in the network

To run SPF more frequently to ensure faster convergence

To replace the SPF algorithm with a simpler routing protocol

To recompute only the affected portion of the shortest path tree when a link changes

A network engineer is designing an IS-IS network with redundant links. The engineer wants to ensure that a specific path is preferred for traffic to a destination, but also wants to provide a backup path. The engineer sets the metric of the primary path to 10 and the backup path to 20. What will the router do?

Install both paths and load balance traffic

Install the backup path as a floating static route

Install both paths in the routing table, using the primary for traffic and the backup for failover

Install only the primary path in the routing table

How does the SPF algorithm affect the time it takes for a network to converge after a topology change?

The SPF calculation time adds to the overall convergence delay

SPF has no impact on convergence time

SPF runs before the topology change is detected

SPF eliminates the need for LSP flooding

A router has six equal-cost IS-IS paths to a destination, but the maximum-paths setting is 4. What will the router do?

Install all six paths but only use four for load balancing

Install only one path to avoid loops

Install all six paths in the routing table

Install four paths, chosen arbitrarily

Juniper NetworksCertified Professional, Service Provider Routing and Switching (JNCIP-SP)

Domain 2Objective 5

SPF Algorithm JN0-664 Practice Questions (Page 2)

Part of the IS-IS domain, which makes up ~18% of our current practice bank. Juniper Networks does not publish an official question count, but from its 90-minute exam (~35–60 total, ~6–11 in this domain), expect 1–1 from this objective — we provide 21 practice questions to prepare you well beyond it. (estimate)

21questions here

5free pages

6concepts

Questions 6–10

6foundation · easy
What does partial route computation (PRC) optimize in IS-IS?
Select an answer first
7foundation · easy
What is the purpose of incremental SPF (iSPF) in IS-IS?
Select an answer first
8expert · hard
A network engineer is designing an IS-IS network with redundant links. The engineer wants to ensure that a specific path is preferred for traffic to a destination, but also wants to provide a backup path. The engineer sets the metric of the primary path to 10 and the backup path to 20. What will the router do?
Select an answer first
9foundation · easy
How does the SPF algorithm affect the time it takes for a network to converge after a topology change?
Select an answer first
10application · medium
A router has six equal-cost IS-IS paths to a destination, but the maximum-paths setting is 4. What will the router do?
Select an answer first

Finished these 5 questions?

Review the revealed explanations, or continue through the curriculum.

Next 5 questions →Back to JN0-664

Free Basic Practice is a study aid with revealable answers — not a scored exam. Examers.io is independent and not affiliated with or endorsed by Juniper Networks. “JN0-664” is a trademark of its owner, used for identification only.