Networking Protocols Quiz

What is the size of the IP v6 address?

• 32 bits

• 64 bits

• 128 bits

• 256 bits

Which of the following statement is correct for IP v6 datagram format?

• The IP v6 datagram format has a 20-byte header.

• The IP v6 datagram format has a 32-byte header.

• The IP v6 datagram format has a 40-byte with optional header.

• The IP v6 datagram format has a 40-byte fixed-length header.

Which of the following statement is correct?

• Fragmentation is not allowed for IP v6.

• Fragmentation is allowed for IP v6.

• Fragmentation is optional for IP v6.

• Fragmentation is fixed for IP v6.

How many 8-bit octets for an IP v6 address?

• 4

• 8

• 12

• 16

Which of the following statement is true for a routing algorithm?

• A routing algorithm is to find the highest-cost path between the source and the destination for forwarding the data.

• A routing algorithm is to find the longest-cost path between the source and the destination for forwarding the data.

• A routing algorithm is to find the least-cost path between the source and the destination for forwarding the data.

• A routing algorithm is to find the average-cost path between the source and the destination for forwarding the data.

The Dijkstra routing algorithm is categorized as

• A link-state routing algorithm

• A distance vector routing protocol

• A hierarchical routing protocol

• An inter-AS routing protocol

The Bellman-Ford routing algorithm is categorized as

• A link-state routing algorithm

• A distance vector routing protocol

• A hierarchical routing protocol

• An inter-AS routing protocol

A graph represented a computer network is given below According to the Dijkstra algorithm, which nodes are selected for constructing the routing table after second round of running the algorithm at node u?

• u,x

• u,v

• u,w

• u,z

Which problem does the Dijkstra routing algorithm possibly face?

• Routing oscillation

• Route congestion

• Route break

• Route restart

In Bellman-Ford routing, which of following statement is appropriate?

• Each network node constructs its distance vector based on routing information shared among neighbor nodes.

• Each network node constructs its distance vector based on its local routing information.

• Each network node constructs its distance vector based on its link state information.

• Each network node constructs its distance vector based on measuring the distance to neighbor nodes.