| 1. |
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 |
| C. | only those packets which are not queued in the router at that time will suffer |
| Answer» B. only those packets which are queued in the router at that time will suffer | |
| 2. |
In datagram subnet new route is chosen ………………… |
| A. | for every packet sent |
| B. | for all the packet sent |
| C. | only for the first packet |
| Answer» A. for every packet sent | |
| 3. |
For a connection oriented service, we need a …………… |
| A. | virtual circuit subnet |
| B. | short circuit subnet |
| C. | datagram subnet |
| Answer» C. datagram subnet | |
| 4. |
In ………………, each packet of a message follows the same path from sender to receiver. |
| A. | circuit switching |
| B. | message switching |
| C. | virtual approach to packet switching |
| Answer» A. circuit switching | |
| 5. |
A permanent virtual circuit involves …………….. |
| A. | connection establishment |
| B. | data transfer |
| C. | connection release |
| Answer» B. data transfer | |
| 6. |
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 |
| C. | sink tree |
| Answer» C. sink tree | |
| 7. |
Adaptive routing algorithms get their information from …………. |
| A. | only from local environment |
| B. | only from adjacent routers |
| C. | from locally, adjacent, external routers |
| Answer» C. from locally, adjacent, external routers | |
| 8. |
In Hierarchical routing for N router subnet, the optimal number of levels is ………….. |
| A. | logn |
| B. | log(n -1) |
| C. | lnn ( |
| Answer» C. lnn ( | |
| 9. |
The router algorithm takes the decision to changes the route when …………….. |
| A. | router changes |
| B. | topology changes |
| C. | user changes |
| Answer» B. topology changes | |
| 10. |
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 |
| C. | temporary routing |
| Answer» A. dynamic routing | |
| 11. |
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 |
| C. | datagram routing |
| Answer» A. session routing | |
| 12. |
…………….. change their routing decisions to reflect changes in the topology. |
| A. | nonadaptive algorithms |
| B. | adaptive algorithms |
| C. | static algorithms |
| Answer» B. adaptive algorithms | |
| 13. |
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 |
| C. | sink tree principle |
| Answer» B. optimality principle | |
| 14. |
……………. do not base their routing decisions on measurements or estimates of the current traffic and topology. |
| A. | non adaptive algorithms |
| B. | adaptive algorithms |
| C. | static algorithms |
| Answer» A. non adaptive algorithms | |
| 15. |
The method of network routing where every possible path between transmitting and receiving DTE is used is called …………… |
| A. | random routing |
| B. | packet flooding |
| C. | directory routing |
| Answer» B. packet flooding | |
| 16. |
In Hierarchical routing, the routers are divided into what is called as …………….. |
| A. | zones |
| B. | cells |
| C. | regions |
| Answer» C. regions | |
| 17. |
The regions in Hierarchical routing are grouped in to …………….. |
| A. | clusters |
| B. | zones |
| C. | blocks |
| Answer» A. clusters | |
| 18. |
The Clusters in Hierarchical routing are grouped in to ……………… |
| A. | clusters |
| B. | zones |
| C. | blocks |
| Answer» B. zones | |
| 19. |
If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as …………….. |
| A. | random flooding |
| B. | static flooding |
| C. | selective flooding |
| Answer» C. selective flooding | |
| 20. |
To do multicast routing, each router computes a ………………… |
| A. | binary tree |
| B. | avl tree |
| C. | spanning tree |
| Answer» C. spanning tree | |
| 21. |
In ………………. to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree. |
| A. | core based trees |
| B. | avl trees |
| C. | binary trees |
| Answer» A. core based trees | |
| 22. |
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 |
| Answer» C. preferred output line, estimated time | |
| 23. |
In distance vector routing algorithm, the routing tables are updated ………………… |
| A. | by exchanging information with the neighbours |
| B. | automatically |
| C. | using the backup database |
| Answer» A. by exchanging information with the neighbours | |
| 24. |
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 |
| Answer» C. when there is a need for route by the host | |
| 25. |
The processes that keep track of all mobile hosts visiting the area is …………….. |
| A. | home agent |
| B. | mobile agent |
| C. | foreign agent |
| Answer» C. foreign agent | |
We're developing a website for study materials for students.
We would love to hear your answers to some of the questions.
