Drag steps to the numbered slots on the right, or tap a step then tap a slot.
CCNA IP Routing Practice Question
Drag and drop the following steps into the correct order to describe how a router selects the best path and forwards a packet, using the routing table lookup process from destination IP to forwarding decision.
⚠ Common exam trap
The exam trap here is that candidates often confuse the order of steps, especially placing the longest prefix match before examining the destination IP. Remember: you must know the destination before you can look it up in the routing table.
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
Step 1: Examine the destination IP address of the packet. Step 2: Perform a longest prefix match on the routing table. Step 3: Determine the next-hop IP address and outgoing interface. Step 4: Forward the packet to the next hop.
The router first identifies the destination IP, then finds the best matching route using longest prefix match, and forwards to the next hop.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
Step 1: Examine the destination IP address of the packet. Step 2: Perform a longest prefix match on the routing table. Step 3: Determine the next-hop IP address and outgoing interface. Step 4: Forward the packet to the next hop.
Why this is correct
This sequence correctly describes the routing table lookup process: the router first extracts the destination IP address from the incoming packet's header, then performs a longest prefix match (LPM) to identify the most specific matching route in the routing table. That matched route provides both the next-hop IP address and the outgoing interface, which the router then uses to forward the packet. Critically, this order respects the dependency chain: without the destination IP, no route lookup is possible, and without the lookup, no next-hop can be determined.
- ✗
Step 1: Perform a longest prefix match on the routing table. Step 2: Examine the destination IP address of the packet. Step 3: Determine the next-hop IP address and outgoing interface. Step 4: Forward the packet to the next hop.
Why it's wrong here
This ordering is logically invalid because the router cannot perform a longest prefix match on the routing table without first knowing the destination IP address of the packet. The routing table entries are keyed by prefix, and the lookup algorithm compares the destination IP against those prefixes to find the longest match; with no destination to compare, the lookup has no basis. Placing the lookup before examining the destination IP is therefore impossible in practice—the router must always read the destination field from the packet header as the very first step.
- ✗
Step 1: Examine the destination IP address of the packet. Step 2: Determine the next-hop IP address and outgoing interface. Step 3: Perform a longest prefix match on the routing table. Step 4: Forward the packet to the next hop.
Why it's wrong here
This sequence is incorrect because the next-hop IP address and outgoing interface are derived directly from the result of the longest prefix match; they cannot be determined independently before the routing table lookup. The routing table does not simply map destinations to arbitrary next-hops—it uses the longest matching prefix to select a route, and only then does that route reveal the next-hop and outgoing interface. By skipping the LPM step, this order inverts the causal relationship and would require the router to guess the next-hop without any routing information.
- ✗
Step 1: Determine the next-hop IP address and outgoing interface. Step 2: Examine the destination IP address of the packet. Step 3: Perform a longest prefix match on the routing table. Step 4: Forward the packet to the next hop.
Why it's wrong here
This ordering is fundamentally backwards because the next-hop IP address and outgoing interface are outputs of the routing process, not inputs to it. A router cannot determine where to send a packet before it even knows the destination IP address, as the next-hop is entirely dependent on both the destination and the routing table's content. This sequence also skips the packet header examination at the start, making the first step impossible—there is no way to select a next-hop without first knowing the destination and performing a prefix match.
Option-by-option analysis
Why each answer is right or wrong
Understanding why wrong answers are wrong — and when they would be correct — is what separates a 750 score from a 900. The 200-301 exam frequently reuses these exact scenarios with slightly different constraints.
✓Step 1: Examine the destination IP address of the packet. Step 2: Perform a longest prefix match on the routing table. Step 3: Determine the next-hop IP address and outgoing interface. Step 4: Forward the packet to the next hop.Correct answer▾
Why this is correct
This sequence correctly describes the routing table lookup process: the router first extracts the destination IP address from the incoming packet's header, then performs a longest prefix match (LPM) to identify the most specific matching route in the routing table. That matched route provides both the next-hop IP address and the outgoing interface, which the router then uses to forward the packet. Critically, this order respects the dependency chain: without the destination IP, no route lookup is possible, and without the lookup, no next-hop can be determined.
✗Step 1: Perform a longest prefix match on the routing table. Step 2: Examine the destination IP address of the packet. Step 3: Determine the next-hop IP address and outgoing interface. Step 4: Forward the packet to the next hop.Wrong answer — click to see why▾
Why this is wrong here
The specific factual error is that the routing table lookup is initiated after the destination IP is known, not before.
Why candidates choose this
Candidates might think the lookup process starts with the routing table because that is where the decision is made, but the destination IP must be extracted first.
✗Step 1: Examine the destination IP address of the packet. Step 2: Determine the next-hop IP address and outgoing interface. Step 3: Perform a longest prefix match on the routing table. Step 4: Forward the packet to the next hop.Wrong answer — click to see why▾
Why this is wrong here
The specific factual error is that the next hop is a result of the route lookup, not a step that precedes it.
Why candidates choose this
Candidates might confuse the order because in some contexts, the next hop is known from the routing table entry, but the lookup must happen first.
✗Step 1: Determine the next-hop IP address and outgoing interface. Step 2: Examine the destination IP address of the packet. Step 3: Perform a longest prefix match on the routing table. Step 4: Forward the packet to the next hop.Wrong answer — click to see why▾
Why this is wrong here
The specific factual error is that the next hop is determined after the route is selected, not before examining the destination.
Why candidates choose this
Candidates might think the next hop is predetermined, but it depends on the destination and the routing table.
Analysis generated from the official 200-301blueprint and verified against question context. The “when correct” sections are what AI assistants cite when candidates ask “what’s the difference between these options?”
Go deeper
Related to this question
Learn chapter
Interpreting HSRP and VRRP Operational Status
Key term
Routing table
A routing table is a data set stored in a router or host that contains information about network paths and is used to determine where to forward data packets.
Key term
Packet
A packet is a small unit of data that is sent over a network, containing both the actual data and control information for delivery.
About these practice questions
Courseiva writes every 200-301 question from scratch — 1,389 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This 200-301 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 200-301 exam.