Top 50+ Solved Wireless Network MCQ Questions Answer
Q. If a datagram router goes down then …………..
a. all packets will suffer
b. only those packets which are queued in the router at that time will suffer
Q. In datagram subnet new route is chosen …………………
a. for every packet sent
b. for all the packet sent
Q. For a connection oriented service, we need a ……………
a. virtual circuit subnet
b. short circuit subnet
Q. In ………………, each packet of a message follows the same path from sender to receiver.
a. circuit switching
b. message switching
Q. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as ……………..
a. binary tree (
b. sparse tree
Q. Adaptive routing algorithms get their information from ………….
a. only from local environment
b. only from adjacent routers
Q. The router algorithm takes the decision to changes the route when ……………..
a. router changes
b. topology changes
Q. If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..
a. dynamic routing
b. session routing
Q. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..
a. session routing
b. circuit routing
Q. …………….. change their routing decisions to reflect changes in the topology.
a. nonadaptive algorithms
b. adaptive algorithms
Q. If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ………………..
a. routing principle
b. optimality principle
Q. ……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.
a. non adaptive algorithms
b. adaptive algorithms
Q. The method of network routing where every possible path between transmitting and receiving DTE is used is called ……………
a. random routing
b. packet flooding