Drag steps to the numbered slots on the right, or tap a step then tap a slot.
Steps
Order
1Step 1
2Step 2
3Step 3
4Step 4
5Step 5
Question 130 of 1,420
mediumDrag & DropObjective-mapped
350-401 Practice Question: Drag and drop the steps of OSPF SPF calculation…
Drag and drop the steps of OSPF SPF calculation steps (Dijkstra) into the correct order, from first to last.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Initialize candidate list with root router
The Dijkstra algorithm first initializes the candidate list with the root node, then iteratively moves the lowest-cost candidate to the tree, updating neighbor costs, and finally builds the routing table from the shortest-path tree.
Visual reference
Quick reference
Routing Protocol Comparison
| Protocol | Metric | Max Hops | Algorithm | Type |
|---|---|---|---|---|
| RIP v2 | Hop count | 15 | Bellman-Ford | Distance vector |
| OSPF | Cost (bandwidth) | Unlimited | Dijkstra (SPF) | Link state |
| EIGRP | Composite metric | Unlimited | DUAL | Hybrid |
| IS-IS | Cost | Unlimited | Dijkstra | Link state |
| BGP | Policy / attributes | Unlimited | Path vector | Path vector |
RIP's 15-hop limit makes it unsuitable for large networks. OSPF and EIGRP dominate modern enterprise deployments.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Same concept, more angles
1 more way this is tested on 350-401
These questions test the same concept from different angles. Work through them to make sure you can recognise it however the exam phrases it.
Variation 1. Drag and drop the steps of OSPF SPF calculation steps (Dijkstra) into the correct order, from first to last.
medium- ✓ A.Initialize candidate list with root router
- ✓ B.Examine root's neighbors and add to candidate list
- ✓ C.Move lowest-cost candidate to SPF tree
- ✓ D.Examine new router's neighbors and update candidate list
- ✓ E.Terminate when all routers in SPF tree
Why A: The Dijkstra SPF algorithm first initializes the candidate list with the root router itself. It then examines the root's neighbors, adding them to the candidate list. The router with the lowest cost is moved from candidate to the SPF tree. The process repeats by examining the newly added router's neighbors and updating the candidate list. Finally, when all routers are in the SPF tree, the algorithm terminates and the routing table is populated.
Last reviewed: Jun 18, 2026
This 350-401 practice question is part of Courseiva's free Cisco certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the 350-401 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.