Q#1: Unicast routing delivers packets to:
(A) One specific destination
(B) All hosts
(C) A group of hosts
(D) None
Answer: (A) One specific destination
Q#2: Routing protocols are used to:
(A) Exchange routing information between routers
(B) Assign MAC addresses
(C) Detect errors
(D) None
Answer: (A) Exchange routing information between routers
Q#3: Unicast routing protocols are mainly divided into:
(A) Distance vector and Link state
(B) ARP and RARP
(C) TCP and UDP
(D) None
Answer: (A) Distance vector and Link state
Q#4: RIP stands for:
(A) Routing Information Protocol
(B) Rapid Internet Protocol
(C) Router Interface Protocol
(D) None
Answer: (A) Routing Information Protocol
Q#5: RIP is based on:
(A) Distance vector algorithm
(B) Link state algorithm
(C) Path vector
(D) None
Answer: (A) Distance vector algorithm
Q#6: RIP uses which metric?
(A) Hop count
(B) Bandwidth
(C) Delay
(D) None
Answer: (A) Hop count
Q#7: Maximum hop count in RIP is:
(A) 15
(B) 16
(C) 30
(D) None
Answer: (A) 15
Q#8: A hop count of 16 in RIP means:
(A) Unreachable
(B) Optimal route
(C) Direct route
(D) None
Answer: (A) Unreachable
Q#9: RIP updates are sent every:
(A) 30 seconds
(B) 10 seconds
(C) 60 seconds
(D) None
Answer: (A) 30 seconds
Q#10: Count-to-infinity problem occurs in:
(A) Distance vector routing
(B) Link state routing
(C) BGP
(D) None
Answer: (A) Distance vector routing
Q#11: Split horizon is used to:
(A) Prevent routing loops
(B) Increase bandwidth
(C) Assign IP
(D) None
Answer: (A) Prevent routing loops
Q#12: OSPF stands for:
(A) Open Shortest Path First
(B) Optimal Shortest Path Forwarding
(C) Open Secure Path First
(D) None
Answer: (A) Open Shortest Path First
Q#13: OSPF is based on:
(A) Link state algorithm
(B) Distance vector
(C) Path vector
(D) None
Answer: (A) Link state algorithm
Q#14: OSPF uses which algorithm?
(A) Dijkstra’s algorithm
(B) Bellman-Ford
(C) Flooding only
(D) None
Answer: (A) Dijkstra’s algorithm
Q#15: OSPF metric is based on:
(A) Cost (bandwidth)
(B) Hop count only
(C) Delay only
(D) None
Answer: (A) Cost (bandwidth)
Q#16: Link state routing requires routers to:
(A) Build complete network topology
(B) Share entire routing table
(C) Use broadcast only
(D) None
Answer: (A) Build complete network topology
Q#17: Distance vector routing shares:
(A) Entire routing table with neighbors
(B) Link state info only
(C) MAC address
(D) None
Answer: (A) Entire routing table with neighbors
Q#18: Convergence time in link state routing is:
(A) Faster than distance vector
(B) Slower
(C) Same
(D) None
Answer: (A) Faster than distance vector
Q#19: OSPF uses areas to:
(A) Improve scalability
(B) Reduce IP addresses
(C) Increase hops
(D) None
Answer: (A) Improve scalability
Q#20: Backbone area in OSPF is:
(A) Area 0
(B) Area 1
(C) Area 10
(D) None
Answer: (A) Area 0
Q#21: EIGRP is considered:
(A) Advanced distance vector (hybrid)
(B) Pure link state
(C) Path vector
(D) None
Answer: (A) Advanced distance vector (hybrid)
Q#22: BGP stands for:
(A) Border Gateway Protocol
(B) Basic Gateway Protocol
(C) Broadband Gateway Protocol
(D) None
Answer: (A) Border Gateway Protocol
Q#23: BGP is mainly used for:
(A) Inter-domain routing
(B) Intra-domain routing
(C) LAN routing
(D) None
Answer: (A) Inter-domain routing
Q#24: BGP is based on:
(A) Path vector routing
(B) Distance vector
(C) Link state
(D) None
Answer: (A) Path vector routing
Q#25: Autonomous System (AS) is:
(A) Group of networks under single administration
(B) Single router
(C) LAN only
(D) None
Answer: (A) Group of networks under single administration
Q#26: Intra-domain routing is used:
(A) Within an AS
(B) Between AS
(C) Only LAN
(D) None
Answer: (A) Within an AS
Q#27: Inter-domain routing is used:
(A) Between AS
(B) Within LAN
(C) Same subnet
(D) None
Answer: (A) Between AS
Q#28: Routing metric may include:
(A) Bandwidth and delay
(B) MAC address
(C) Port number
(D) None
Answer: (A) Bandwidth and delay
Q#29: Routing convergence means:
(A) Routers have consistent tables
(B) Routing stopped
(C) Packet lost
(D) None
Answer: (A) Routers have consistent tables
Q#30: Flooding in link state routing is used to:
(A) Distribute link state information
(B) Send data
(C) Broadcast ARP
(D) None
Answer: (A) Distribute link state information
Q#31: Bellman-Ford algorithm is used in:
(A) Distance vector routing
(B) Link state routing
(C) BGP
(D) None
Answer: (A) Distance vector routing
Q#32: Administrative distance defines:
(A) Trustworthiness of routing source
(B) Hop count
(C) Bandwidth
(D) None
Answer: (A) Trustworthiness of routing source
Q#33: RIPng is used for:
(A) IPv6
(B) IPv4
(C) ARP
(D) None
Answer: (A) IPv6
Q#34: OSPFv3 supports:
(A) IPv6
(B) IPv4 only
(C) ARP
(D) None
Answer: (A) IPv6
Q#35: Routing loops cause:
(A) Packet circulating endlessly
(B) Fast delivery
(C) Error detection
(D) None
Answer: (A) Packet circulating endlessly
Q#36: Triggered updates in RIP are sent when:
(A) Route changes
(B) Every 30 seconds only
(C) Never
(D) None
Answer: (A) Route changes
Q#37: Hierarchical routing improves:
(A) Scalability
(B) Hop count
(C) Error detection
(D) None
Answer: (A) Scalability
Q#38: Equal-cost multipath allows:
(A) Load balancing
(B) Fragmentation
(C) ARP mapping
(D) None
Answer: (A) Load balancing
Q#39: BGP uses TCP port:
(A) 179
(B) 80
(C) 53
(D) None
Answer: (A) 179
Q#40: Path vector routing prevents loops by:
(A) Keeping path information
(B) Using hop count only
(C) Flooding
(D) None
Answer: (A) Keeping path information
Q#41: OSPF neighbors exchange:
(A) Hello packets
(B) ARP packets
(C) ICMP only
(D) None
Answer: (A) Hello packets
Q#42: Distance vector routing is simpler but:
(A) Slower convergence
(B) Faster convergence
(C) More complex
(D) None
Answer: (A) Slower convergence
Q#43: Routing protocols operate at:
(A) Network layer
(B) Transport layer
(C) Application layer
(D) None
Answer: (A) Network layer
Q#44: AS number uniquely identifies:
(A) Autonomous system
(B) Router
(C) Host
(D) None
Answer: (A) Autonomous system
Q#45: OSPF uses LSAs to:
(A) Describe network links
(B) Assign IP
(C) Detect errors
(D) None
Answer: (A) Describe network links
Q#46: BGP routing decisions are based on:
(A) Policies and AS path
(B) Hop count only
(C) MAC address
(D) None
Answer: (A) Policies and AS path
Q#47: RIP is suitable for:
(A) Small networks
(B) Large ISP networks
(C) Internet backbone
(D) None
Answer: (A) Small networks
Q#48: OSPF supports:
(A) Classless routing (CIDR)
(B) Classful only
(C) Broadcast only
(D) None
Answer: (A) Classless routing (CIDR)
Q#49: Route summarization reduces:
(A) Routing table size
(B) Packet size
(C) TTL
(D) None
Answer: (A) Routing table size
Q#50: Main goal of unicast routing protocols is:
(A) Efficient path selection for single-destination delivery
(B) Broadcast
(C) MAC assignment
(D) None
Answer: (A) Efficient path selection for single-destination delivery