In the SPF computation, how are stub networks (e.g., loopback interfaces) represented in the link-state database?

As stub links in the router LSA with a cost but no neighbor router ID

As summary LSAs advertised to other areas

As external LSAs with a forwarding address

As separate network LSAs generated by the router

What is the primary purpose of the SPF algorithm in OSPF?

To authenticate OSPF hello packets exchanged between neighbors

To flood link-state advertisements to all routers in the area

To compute the shortest path from each router to every other router in the OSPF domain

To elect the designated router on a broadcast segment

An OSPF router is running Dijkstra's algorithm. It has just moved a router from the candidate list to the tree list. What must the router do next to continue the computation correctly?

Add the router's own ID to the candidate list

Remove all entries from the candidate list and restart the algorithm

Move the next candidate to the tree list without examining neighbors

Examine the newly added router's neighbors and update their costs in the candidate list

What role does the shortest-path tree play in OSPF's operation?

It represents the topology of the entire OSPF domain from the perspective of a single router

It identifies which routers are area border routers (ABRs) in the domain

It shows the physical cabling between all routers in the network

It lists all routers that have formed full adjacencies with the local router

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

Domain 1Objective 5

SPF Algorithm JN0-664 Practice Questions (Page 1)

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

28questions here

6free pages

10concepts

Questions 1–5

1foundation · easy
In the SPF computation, how are stub networks (e.g., loopback interfaces) represented in the link-state database?
Select an answer first
2foundation · easy
What is the primary purpose of the SPF algorithm in OSPF?
Select an answer first
3application · medium
An OSPF router is running Dijkstra's algorithm. It has just moved a router from the candidate list to the tree list. What must the router do next to continue the computation correctly?
Select an answer first
4foundation · easy
What role does the shortest-path tree play in OSPF's operation?
Select an answer first
5application · medium
A service provider operates a large OSPF backbone with hundreds of routers. A single link between two core routers fails, causing a small topology change. The network operator wants to minimize CPU usage on all routers during this event. Which OSPF feature should be enabled to achieve this goal?
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.