Computer Networks - Quizz

Count-to-Infinity problem occurs in .....................

• distance vector routing

• short path first

• link state routing

• hierarchical routing

This set of Computer Networks focuses on “OSPF”

• Link state protocol

• Error-correction protocol

• Routing information protocol

• Border gateway protocol

The computation of the shortest path in OSPF is usually done by ____________

• Bellman-ford algorithm

• Routing information protocol

• Dijkstra’s algorithm

• Distance vector routing

Which of the following is not a type of OSPF packet

• Hello

• Link-state request

• Link-state response

• Link-state ACK

What is the correct order of the operations of OSPF?

i – Hello packets

ii – Propagation of link-state information and building of routing tables

iii – Establishing adjacencies and synchronization of database

• i-ii-iii

• i-iii-ii

• iii-ii-i

• ii-i-iii

In OSPF header, which field is used to detect errors in the packet?

• Type

• Area ID

• Authentication type

• Checksum

8. In OSPF database descriptor packet, if there are more database descriptor packets in the flow, ‘M’ field is set to ____________

• 1

• 0

• more

• -1

In OSPF database descriptor packet, which field is used to indicate that the router is master?

• M

• MS

• I

• Options

In OSPF database descriptor packet, which field is used to detect a missing packet?

• LSA header

• MS

• Database descriptor sequence number

• Options

Which of the following is the ethernet broadcast address used in ARP and RARP requests?

• 255.255.255.255

• 08:00:20:11:aa:01

• ff:ff:ff:ff:ff:ff

• 224.0.0.0