Scribd
Upload
151 views5 pages

It-416 Assignment 3: M3 Group

This document contains 20 multiple choice questions about various routing protocols and concepts in computer networks. The questions cover topics like greedy state routing (GSR), link state routing, distance vector routing, ad hoc on-demand distance vector (AODV), dynamic source routing (DSR), destination-sequenced distance-vector (DSDV) routing, and temporally-ordered routing algorithm (TORA). The document also includes the answers to each multiple choice question.

Uploaded by

Shivam Latiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
151 views5 pages

It-416 Assignment 3: M3 Group

This document contains 20 multiple choice questions about various routing protocols and concepts in computer networks. The questions cover topics like greedy state routing (GSR), link state routing, distance vector routing, ad hoc on-demand distance vector (AODV), dynamic source routing (DSR), destination-sequenced distance-vector (DSDV) routing, and temporally-ordered routing algorithm (TORA). The document also includes the answers to each multiple choice question.

Uploaded by

Shivam Latiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

IT-416 ASSIGNMENT 3

M3 GROUP
Sanjana Ghodeshwar, Gandharv Wadhwa, Siddhant Jain, Sparsh Gupta, Mainak
Ghosh, Anmol Jain

1. Which of the following is ​not ​true about GSR?

a. Higher accuracy in generating optimal path as compared to LSR


b. Reduced error rate as compare to LSR
c. Little bandwidth consumption
d. High operational cost

2. Which of the following is true about FSR?

a. Routing information is less detailed as distance increases


b. Link state of immediate neighbors are exchanged more frequently
c. The exchange frequency decreases with distance
d. All of the above

3. Which of the statements mentioned below is ​not ​true about Link state routing (as compared
to Distance vector routing)?

a. More bandwidth required


b. Converges faster
c. No count to infinity problem
d. Persistent looping problem

4. AODV is an extension of which routing protocol?

a. GSR
b. DSR
c. DSDV
d. None of the above

5. What factors influence the selection of data paths on routing?


a. Network traffic and network interference
b. Quality of network connections and network connections
c. Number of networks used
d. All of the above

6. Which of the following does not belong to the category of Proactive routing?

a. FORP
b. STAR
c. DSDV
d. GSR

7. Which of the following is not a suitable metric used for route selection in power aware routing
protocol?

a. Minimal energy consumption per a packet


b. Maximize the network connectivity
c. Maximum variance in node power levels
d. Minimum cost per a packet

8. Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of
the following is true?

a. In LS, the shortest path algorithm is run only at one node


b. Count to infinity is a problem only with DV and not LS routing
c. In DV, the shortest path algorithm is run only at one node
d. DV requires more number of network messages than LS

9. Which are the two important properties of DSR protocol

a. DSR route discovery and DSR route acknowledgement


b. DSR route reply and DSR route acknowledgment
c. DSR route discovery and DSR route maintenance
d. DSR route reply and DSR route maintenance

10. Which of the statement(s) mentioned below is/are true about adhoc networks

a. Ad Hoc networks are infrastructure less networks


b. Wireless Ad Hoc networks are self configuring and self organizing
c. Ad Hoc networks are easy to deploy
d. All of the above

11. Which of the statement is false about DSDV routing protocol

a. DSDV is an efficient protocol for route discovery


b. Loop free paths are guaranteed in DSDV
c. Route discovery latency is very high
d. DSDV generates high volume of traffic for high density and highly mobile networks

12. Which statement is false about TORA protocol

a. QRY(query) packets are used for creating routes


b. UPD (update) packets are used only to maintain routes
c. CLR (clear) packets are used for erasing routes
d. None of the above

13. Which of the following is not a phase in Temporally Ordered Routing Protocol ?

a. Route Creating
b. Route Modification
c. Route Maintenance
d. Route Erasure

14. What does the metric used in Temporally Ordered Routing Protocol consist of ?

a. Logical Time of link failure


b. Unique Id of the node
c. A reflector indicator bit and a propagation ordering parameter.
d. All of the above

15. What among the following features, is false about Temporally Ordered Routing Protocol ?

a. Highly Adaptive
b. Efficient
c. Loop-dependent
d. Scalable

16. Dynamic source routing(DSR) protocol is __________ routing protocol.

a. pro-active/table driven
b. reactive/on-demand
c. pro-active/on demand
d. reactive/table driven

17. In ______ , we try to create an appropriate environment for the traffic.

a. congestion control
b. quality of service
c. either 1) and 2)
d. both 1) and 2)

18. In AODV routing algorithm, the route is discovered at the time

a. Only when network is established


b. In middle of the transmission
c. When there is a need for route by the host
d. When there is no need for route by the host

19. DSDV is based on which routing algorithm?

a. Bellman-Ford
b. Dijkstra’s
c. Floyd-Warshall
d. None of the above

20. In GSR, each of the mobile nodes contains which of the following tables?

a. topology table
b. next hop table
c. distance table.
d. All of the above
Answers:

A1. C
A2. D
A3. D
A4. B
A5. D
A6. A
A7. C
A8. B
A9. C
A10. D
A11. C
A12. B
A13. B
A14. D
A15. C
A16. B
A17. B
A18. C
A19. A
A20. D

You might also like