Friday, 21 August 2015

Computer Networks Multiple Choice Questions - Set 4

1.       In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require ....................
(A) n pruned spanning trees must be stored for a total of mn trees
(B) m pruned spanning trees must be stored for a total of m trees
(C) n pruned spanning trees must be stored for a total of n trees
(D) m pruned spanning trees must be stored for a total of mn trees
Answer: D
2.       To do multicast routing, each router computes a .....................
(A) Binary tree              (B) AVL tree
(C) Spanning tree       (D) None of these
Answer: C
3.       A well -defined groups that are numerically large in size but small compared to the network as a whole are used in .......................
(A) Unicast routing                  (B) Multicast routing
(C) Broadcast routing             (D) Telecast routing
Answer: B
4.       The processes that keep track of hosts whose home is in the area, but who currently visiting another area is .................
(A) Home agent           (B) Mobile agent
(C) Foreign agent        (D) User agent
Answer: A
5.       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            (D) Sparse trees
Answer: A

6.       Sending a packet to all destinations simultaneously is called ...................
(A) Multicasting                        (B) Unicasting
(C) Telecasting                        (D) Broadcasting
Answer: D
7.       A normal Flooding technique is an example of ..................
(A) Multicasting                        (B) Unicasting
(C) Telecasting                        (D) Broadcasting
Answer: D
8.       In Broadcast routing, if the router does not know anything all about spanning tree, ...................  method is preferred.
(A) Reverse Path forwarding (B) Multidestination
(C) Flooding                             (D) spanning tree
Answer: A
9.       The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is ...................
(A) Reverse Path forwarding (B) Spanning tree
(C) Multidestination                (D) Flooding
Answer: C
10.    Sending a message to a well defined group that are numerically large in size but small compared to the network as a whole is called ...................
(A) Unicasting              (B) Multicasting
(C) Broadcasting         (D) None of these
Answer: B


0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App