wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Routing Part1

Total questions: 8

Worksheet time: 4mins

Name
Class
Date
1.

Dijkstra’s Algorithm is used by which protocol?

a)

RIP

b)

OSPF

c)

BGP

2.

When does Count-to-infinity happen?

a)

A shorter link cost is found

b)

A longer link cost is found

c)

A link is broken

3.

Never advertise a destination through its next hop is the principle of which one?

a)

Poison Reverse

b)

Split Horizon

c)

Count-to-Infinity

d)

Convergence

4.

Dijkstra's Algorithm is used for?

a)

Calculate the shortest path

b)

Reliable Flooding

c)

Avoid a broken link

d)

Three-node instability

5.

In which mechanism, Router A will advertise the router that it knows from its neighbor back but specifying the infinity cost?

a)

Count-to-Infinity

b)

Split Hozion

c)

Poison Reverse

d)

Three-node Instability

6.

Which protocol that each router must have the complete knowledge about all other routers in the same network?

a)

RIP

b)

OSPF

7.

Which protocol takes the longer time until the convergence?

a)

RIP

b)

OSPF

8.

Which protocol has the load balancing feature?

a)

RIP

b)

OSPF

c)

BGP