CERTIFICATE IN WIRELESS NETWORK /30 2 Your Examination is Complete ! CERTIFICATE IN WIRELESS NETWORK 1 / 30The router algorithm takes the decision to changes the route when …………….. router changes topology changes user changes transmission time does not change 2 / 30In military applications where large number of routers may be blown to bits at any instant, we use ………………. Shortest path first First come first serve Forwarding Flooding 3 / 30In …………… circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM. space division time division virtual None of these 4 / 30If 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 Early flooding 5 / 30In ……………., each packet of a message need not follow the same path from sender to receiver. circuit switching message switching virtual approach to packet switching datagram approach to packet switching 6 / 30……………. do not base their routing decisions on measurements or estimates of the current traffic and topology. Non adaptive algorithms Non adaptive algorithms Static algorithms Recursive algorithms 7 / 30…………….. change their routing decisions to reflect changes in the topology Nonadaptive algorithms Adaptive algorithms Static algorithms Recursive algorithms 8 / 30If 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 no packets will suffer 9 / 30Flooding always choose the ……………….. Shortest path First path Last path Largest path 10 / 30Adaptive routing algorithms get their information from only from local environment only from adjacent routers from locally, adjacent, external routers only from external routers 11 / 30In datagram subnet new route is chosen ………………… for every packet sent for all the packet sent only for the first packet for the packet which is not transmitted 12 / 30In ………………, each packet of a message follows the same path from sender to receiver. circuit switching message switching virtual approach to packet switching datagram approach to packet switching 13 / 30The PSTN is an example of a ………………… network packet switched circuit switched message switched None of these 14 / 30If 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 Forwarding 15 / 30If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ……………… does not exist optimal maximum constant 16 / 30In shortest path routing algorithm, the path length is measured based on …………….. time delay number of hops size of the routers routing table 17 / 30For a connection oriented service, we need a …………… virtual circuit subnet short circuit subnet datagram subnet wireless subnet 18 / 30The method of network routing where every possible path between transmitting and receiving DTE is used is called Random Routing Packet Flooding Directory Routing Message Switching 19 / 30Each packet is routed independently in ………………. virtual circuit subnet short circuit subnet datagram subnet ATM subnet 20 / 30The regions in Hierarchical routing are grouped in to …………….. Cluster Zone Blocks Cells 21 / 30The Clusters in Hierarchical routing are grouped in to ……………… Clusters Zones Blocks Cells 22 / 30If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ………………. Dynamic routing Session routing Temporary routing Static routing 23 / 30In Hierarchical routing for N router subnet, the optimal number of levels is ………….. logN log(N -1) lnN ln 24 / 30Which type of switching uses the entire capacity of a dedicated link? circuit switching datagram packet switching virtual circuit packet switching message switching 25 / 30If 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 Network principle 26 / 30If 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 Temporary routing 27 / 30In distributed applications, it is sometimes necessary to update all the databases concurrently, we use ………………….. Shortest path first First come first serve Forwarding Flooding 28 / 30The 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 AVL tree 29 / 30A permanent virtual circuit involves …………….. Connection establishment Data transfer Connection release Connection check 30 / 30In Hierarchical routing, the routers are divided into what is called as …………….. zones Cells Regions None of these Exit