1. In
link state routing, after the construction of link state packets new routes are
computed using .....................
(A) Bellman Ford algorithm (B) DES algorithm
(C) Dijkstra's algorithm (D) Leaky bucket algorithm
Answer: C
2. Count-to-Infinity
problem occurs in .....................
(A) distance vector routing (B) short path first
(C) link state routing (D) hierarchical routing
Answer: A
3. In
distance vector routing algorithm, each router maintains a separate routing
table with the following entries.
(A) preferred input line , estimated time
(B) preferred input line, estimated distance
(C) preferred output line, estimated time
(D) preferred output line, router
Answer: C
4. Link
state packets are built in ....................
(A) short path first (B) distance vector routing
(C) link state routing (D) hierarchical routing
Answer: B
5. In
which routing method do all the routers have a common database?
(A) Distance Vector (B) Link Vector
(C) Shortest path (D) Link State
Answer: D
6. In
distance vector routing algorithm, the routing tables are updated
.....................
(A) by exchanging information with the neighbours
(B) automatically
(C) using the backup database
(D) by the server
Answer: A
7. Distance
vector routing algorithm is implemented in Internet as ........................
(A) OSPF (B)
RIP
(C) ARP (D)
APR
Answer: B
8. Which
of the following routing algorithm takes into account the current network load.
(A) broadcast (B)
shortest path
(C) flooding (D)
distance vector routing
Answer: D
9. In
distance vector routing the delay metric is ...................
(A) number of hops (B) geographical distance
(C) number of neighbours (D) queue length
Answer: D
10. In
AODV routing algorithm for MANETs, the route is discovered at time
(A) only when the network is established
(B) in middle of the transmission
(C) when there is a need for route by the
host
(D) when there is no need for route by the
host
Answer: C
0 Comments