Computer Networks MCQs

A. True
B. False
C.
D.

A. Exposing routing tables to neighbors
B. Sending duplicate packets to nodes
C. Communicating with every router using messages
D. Spreading link state packets

A. Information about topology
B. Sequence number
C. Age
D. Number of nodes it visits

A. Creating lsp €? flooding €? shortest path tree €? calculating routing table
B. Shortest path tree €? flooding €? creating lsp €? calculating routing table
C. Creating lsp €? flooding €? calculating routing table €? shortest path tree
D. Shortest path tree €? flooding €? calculating routing table -creating lsp

A. Ospf
B. Rip
C. Dijkstra algorithm
D. Bgp

A. Ospf
B. Bgp
C. Rip
D. Oslr

A. Uses more memory
B. Flood of advertisements
C. Less routing loops
D. Need for administrator

A. Line state autonomy
B. Line state advertisement
C. Link state advertisement
D. Link sate for autonomous

A. True
B. False
C.
D.

A. Number of bits in the network
B. Number of total bits in the ip address
C. Number of bits in the host
D. Number of hosts remaining