In the Dijkstra algorithm the process of finding the shortest path sta – McqOptions

MCQOPTIONS

1.	In the Dijkstra algorithm the process of finding the shortest path starts with a tree with _______ node(s).
A.	3
B.	2
C.	1
D.	none of the above
Answer» D. none of the above

Discussion

No Comment Found

Related MCQs

The size of an updating packet in distance vector routing is normally ___________ the size of an updating packet in a link state routing.
In distance vector routing, the updating packet conveys the knowledge of the router about ________________.
In distance vector routing, a router sends its updating packet ______________.
In distance vector routing, the updating packets are sent ________________.
In distance vector routing, if a router is connected to three networks, its original table contains _________ entries.
In distance vector routing, a router has a route as Destination: N, Hop Count: 7, Next Hop: B. It receives a packet from C with a route to N as Destination: N, Hop Count: 6. The new route to N should be _______________.
In link state routing, a router sends its updating packet ______________.
In link state routing, the updating packets are sent ________________.
In link state routing, the routing table for each router is ___________ other routers
In link state routing, the link state database for each router is ___________ other routers