MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 113 Mcqs, each offering curated multiple-choice questions to sharpen your Bachelor of Sc in Information Technology knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
…………….. change their routing decisions to reflect changes in the topology. |
| A. | nonadaptive algorithms |
| B. | adaptive algorithms |
| C. | static algorithms |
| Answer» C. static algorithms | |
| 102. |
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» B. circuit routing | |
| 103. |
If 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 ………………. |
| A. | dynamic routing |
| B. | session routing |
| C. | temporary routing |
| D. | |
| Answer» E. | |
| 104. |
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» B. session routing | |
| 105. |
The router algorithm takes the decision to changes the route when …………….. |
| A. | router changes |
| B. | topology changes |
| C. | user changes |
| Answer» C. user changes | |
| 106. |
In Hierarchical routing for N router subnet, the optimal number of levels is ………….. |
| A. | logn |
| B. | log(n -1) |
| C. | lnn ( |
| Answer» D. | |
| 107. |
Adaptive routing algorithms get their information from …………. |
| A. | only from local environment |
| B. | only from adjacent routers |
| C. | from locally, adjacent, external routers |
| Answer» D. | |
| 108. |
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» D. | |
| 109. |
A permanent virtual circuit involves …………….. |
| A. | connection establishment |
| B. | data transfer |
| C. | connection release |
| Answer» C. connection release | |
| 110. |
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» B. message switching | |
| 111. |
For a connection oriented service, we need a …………… |
| A. | virtual circuit subnet |
| B. | short circuit subnet |
| C. | datagram subnet |
| Answer» D. | |
| 112. |
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» B. for all the packet sent | |
| 113. |
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» C. only those packets which are not queued in the router at that time will suffer | |