A. Link state protocol
B. Error-correction protocol
C. Routing information protocol
D. Border gateway protocol

A. Bellman-ford algorithm
B. Routing information protocol
C. Dijkstra’s algorithm
D. Distance vector routing

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

A. Link state protocol
B. Error-correction protocol
C. Routing information protocol
D. Hello protocol

A. Hello
B. Link-state request
C. Link-state response
D. Link-state ack

A. I-ii-iii
B. I-iii-ii
C. Iii-ii-i
D. Ii-i-iii

A. Type
B. Area id
C. Authentication type
D. Checksum

A. 1
B. 0
C. More
D. -1

A. M
B. Ms
C. I
D. Options

A. Lsa header
B. Ms
C. Database descriptor sequence number
D. Options