A. Link state protocol
B. Error-correction protocol
C. Routing information protocol
D. Border gateway protocol
Explanation: In OSPF, the link state of each path is checked, and then the shortest path is chosen among only the open state links. Each OSPF router monitors the cost of the link to each of its neighbors and then floods the link state information to other routers in the network.
A. Bellman-ford algorithm
B. Routing information protocol
C. Dijkstra’s algorithm
D. Distance vector routing
Explanation: Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year 1956. It is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.
A. Support for fixed-length subnetting by including the subnet mask in the routing message
B. More flexible link cost than can range from 1 to 65535
C. Use of designated router
D. Distribution of traffic over multiple paths that have equal cost to the destination
Explanation: OSPF provides support for variable-length sunbathing by including the subnet mask in the routing message. For fixed length subnets, there is no requirement for including the subnet mask in the routing message as there is just one subnet mask for all the subnets.
A. Link state protocol
B. Error-correction protocol
C. Routing information protocol
D. Hello protocol
Explanation: Hello protocol is used to discover neighboring routers automatically. It makes sure that the communication between neighbors is bidirectional. It’s similar to the real world moral construct of saying “Hello” to initialize the communication.
A. Hello
B. Link-state request
C. Link-state response
D. Link-state ack
Explanation: The five types of OSPF packets are: Hello, Database description, Link-state request, Link-state update, and Link-state ACK. There is no Link-state response packet; the neighbor router sends a Link-state update packet as a response to the Link-state request packet if there is an update in the routing table.
A. I-ii-iii
B. I-iii-ii
C. Iii-ii-i
D. Ii-i-iii
Explanation: OSPF first implements a hello protocol. Then it later on tries to establish synchronisation with database. Later on building of routing tables is done.
A. Type
B. Area id
C. Authentication type
D. Checksum
Explanation: Checksum field is used to detect errors. It makes sure that the data portions that are being sent are all in integrity. It can detect duplicated bits. Once an error is detected, the sender has to re-transmit the data as it won’t receive an acknowledgement.
A. 1
B. 0
C. More
D. -1
Explanation: The “M” bit is the more bit, which indicates that there are more packets to be received in the descriptor packet flow whenever it is set to 1. There is also an “I” bit which indicates if the packet is first in the flow.
A. M
B. Ms
C. I
D. Options
Explanation: The MS bit is used to indicate if the origin of the packet is a master or a slave. If it is set to 1, the source of the packet is a master, and if it is set to 0, the source of the packet is a slave.
A. Lsa header
B. Ms
C. Database descriptor sequence number
D. Options
Explanation: Sequence number field is used to detect a missing packet. The packets are to be received in order of the sequence number, so if the receiver detects that there is a sequence number skipped or missing in the order, it stops processing the further received packets and informs the sender to retransmit the packets in sequence.