On This Page

This set of Wireless Network Multiple Choice Questions & Answers (MCQs) focuses on Wireless Network Set 1

Q1 | If a datagram router goes down then …………..
  • all packets will suffer
  • only those packets which are queued in the router at that time will suffer
  • only those packets which are not queued in the router at that time will suffer
Q2 | In datagram subnet new route is chosen …………………
  • for every packet sent
  • for all the packet sent
  • only for the first packet
Q3 | For a connection oriented service, we need a ……………
  • virtual circuit subnet
  • short circuit subnet
  • datagram subnet
Q4 | In ………………, each packet of a message follows the same path from sender to receiver.
  • circuit switching
  • message switching
  • virtual approach to packet switching
Q5 | A permanent virtual circuit involves ……………..
  • connection establishment
  • data transfer
  • connection release
Q6 | The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as ……………..
  • binary tree (
  • sparse tree
  • sink tree
Q7 | Adaptive routing algorithms get their information from ………….
  • only from local environment
  • only from adjacent routers
  • from locally, adjacent, external routers
Q8 | In Hierarchical routing for N router subnet, the optimal number of levels is …………..
  • logn
  • log(n -1)
  • lnn (
Q9 | The router algorithm takes the decision to changes the route when ……………..
  • router changes
  • topology changes
  • user changes
Q10 | If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..
  • dynamic routing
  • session routing
  • temporary routing
Q11 | If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..
  • session routing
  • circuit routing
  • datagram routing
Q12 | …………….. change their routing decisions to reflect changes in the topology.
  • nonadaptive algorithms
  • adaptive algorithms
  • static algorithms
Q13 | 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 ………………..
  • routing principle
  • optimality principle
  • sink tree principle
Q14 | ……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.
  • non adaptive algorithms
  • adaptive algorithms
  • static algorithms
Q15 | The method of network routing where every possible path between transmitting and receiving DTE is used is called ……………
  • random routing
  • packet flooding
  • directory routing
Q16 | In Hierarchical routing, the routers are divided into what is called as ……………..
  • zones
  • cells
  • regions
Q17 | The regions in Hierarchical routing are grouped in to ……………..
  • clusters
  • zones
  • blocks
Q18 | The Clusters in Hierarchical routing are grouped in to ………………
  • clusters
  • zones
  • blocks
Q19 | If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as ……………..
  • random flooding
  • static flooding
  • selective flooding
Q20 | To do multicast routing, each router computes a …………………
  • binary tree
  • avl tree
  • spanning tree
Q21 | In ………………. to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree.
  • core based trees
  • avl trees
  • binary trees
Q22 | In distance vector routing algorithm, each router maintains a separate routing table with the following entries.
  • preferred input line , estimated time
  • preferred input line, estimated distance
  • preferred output line, estimated time
Q23 | In distance vector routing algorithm, the routing tables are updated …………………
  • by exchanging information with the neighbours
  • automatically
  • using the backup database
Q24 | In AODV routing algorithm for MANETs, the route is discovered at time
  • only when the network is established
  • in middle of the transmission
  • when there is a need for route by the host
Q25 | The processes that keep track of all mobile hosts visiting the area is ……………..
  • home agent
  • mobile agent
  • foreign agent