Monday, 27 July 2015

Computer Networks Multiple Choice Questions - Set 2

1.       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     (D) AVL tree
Answer: C
2.       Adaptive routing algorithms get their information from .............
(A) only from local environment
(B) only from adjacent routers
(C) from locally, adjacent, external routers
(D) only from external routers
Answer: C
3.       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) Static routing
Answer: D
4.       In Hierarchical routing for N router subnet, the optimal number of levels is ..............
(A) logN             (B) log(N -1)
(C) lnN               (D) ln(N-1)
Answer: C
5.       The router algorithm takes the decision to changes the route when .................
(A) router changes
(B) topology changes
(C) user changes
(D) transmission time does not change
Answer: B

6.       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                        (D) None of these
Answer: A
7.       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              (D) Forwarding
Answer: A
8.       ................. change their routing decisions to reflect changes in the topology.
(A) Nonadaptive algorithms
(B) Adaptive algorithms
(C) Static algorithms
(D) Recursive algorithms
Answer: B
9.       If 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 ..................
(A) does not exist         (B) optimal
(C) maximum                (D) constant
Answer: B
10.    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             (D) Network principle
Answer: B


0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App