Routing Table: practice questions

Reading a routing table and how a router chooses a route: longest prefix match, administrative distance and metric.

CCNA 200-301 v2.0, exam topic 3.1 · part of 3. IP Routing, 20% of the exam

The same material in the CCNA 200-301 v1.1 exam: Routing Table

The same material in the CCNA 200-301 v1.1 exam: Forwarding Decisions

What this topic covers

Routing table entries
Destination prefix, next hop and outgoing interface.
Forwarding versus routing
Forwarding uses the table; routing builds it.
Reading routing tables
Finding the entry a packet will use.
Longest-match rule
The most specific matching prefix wins.
Choosing among routing sources
When several protocols offer the same prefix, a preference decides.
What a metric measures
Hop count, cost or delay used to pick the best path.
Equal-cost multipath
Splitting traffic across paths with the same metric.
Convergence
Routers exchange information until tables are consistent.

Sample question

Try it, then open the answer. Our questions are written by AI and checked independently before they are published.

Easy Multiple choice

Which two characteristics describe a connected route in a routing table? (Choose two.)

  1. A. source code C
  2. B. static route code S
  3. C. OSPF administrative distance 110
  4. D. administrative distance 0
  5. E. a listed next hop IP address
Show the answer

Answers: A. source code C; D. administrative distance 0

A connected route, shown by show ip route with code C, has administrative distance 0, the most preferred value of any routing source. Its entry names only the exit interface, because the subnet is reached directly and no next-hop router is involved.

Further reading