0% found this document useful (0 votes)
50 views

Hcnia

The document contains questions about OSPF routing protocol concepts including: 1) Four statements regarding OSPF router adjacencies are correct: fully adjacent routers can be connected via point-to-point or point-to-multipoint networks, and broadcast networks require a DR or BDR. 2) OSPF routers become neighbors after exchanging Hello and LSA packets. 3) An OSPF router's link state database is formed based on local LSAs and those advertised by neighboring routers.

Uploaded by

Nassim Ksouri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
50 views

Hcnia

The document contains questions about OSPF routing protocol concepts including: 1) Four statements regarding OSPF router adjacencies are correct: fully adjacent routers can be connected via point-to-point or point-to-multipoint networks, and broadcast networks require a DR or BDR. 2) OSPF routers become neighbors after exchanging Hello and LSA packets. 3) An OSPF router's link state database is formed based on local LSAs and those advertised by neighboring routers.

Uploaded by

Nassim Ksouri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1) Which of the following statements regarding adjacencies of OSPF routers are correct?

(Select 4
Answers)

A. After two routers have been received the Hello packets from each other, they will form the
adjacency automatically.

B. If two routers are fully adjacent, the network type between them may be Point-to-Point network.

C. If two routers are fully adjacent, the network type between them may be Point-to-Multipoint
network.

D. If two routers are fully adjacent and the network type between them is broadcast network, then
one of routers must be either DR or BDR.

E. Only two adjacent routers can exchange LSAs.

2) Two OSPF routers become neighbors only after they successfully exchange ( ) packets and LSAs.

A. Hello

B. DD

C. LSR

D. LSU

3) The link state database (LSDB) on an OSPF router is formed based on ( ). (Select 2 Answers)

A. local LSA

B. LSA advertised by a neighboring router

C. RSVP packet advertised to a neighboring router

D. RSVP packet advertised by a neighboring router

4) Which of the following protocols are routing protocols? (Select 2 Answers)

A. RIP

B. OSPF

C. PPP

D. IPX

5) What functions does a Hello packet of OSPF implement? (Select 2 Answers)

A. Discover a neighbor.

B. Delete unreachable neighbors as specified time.

C. Maintain neighborhood.
D. Negotiate parameters among adjacent ports.

6) A router with OSPF enabled calculates the shortest route to the destination by using ( ) algorithm.

A. OSPF

B. SPF

C. SRC

D. OPF

7) Which of the following statements regarding OSPF area are incorrect? (Select 2 Answers)

A. Without manual configuration, an OSPF area is a backbone area with area ID 0 by default.

B. OSPF supports area division.

C. Every OSPF area is identified by a 32-bit Area ID number.

D. Area ID must be assigned by IANA and we can not simply assign it.

8) On VRP platform, which of the following is the default route preference value for OSPF routing
protocol?

A. 10

B. 1

C. 100

D. 120

9) OSPF runs over the IP protocol and the IP protocol No. used by OSPF is ( ).

A. 89

B. 80

C. 512

D. 2328

10) Which of the following statemetns regarding the OSPF router types are incorrect? (Select 3
Answers)

A. ABR can be ASBR at the same time

B. ABR is the oruter connecting any two OSPF areas and it can be used to transmit the routing
information between them

C. The router inside an OSPF area can not be ASBR

D. An OSPF router can belong to two or more areas but can be the ABR for a “single” area only
11) In an OSPF area, routers exchange information about ( ). This type of information forms an
information library.

A. Link status

B. Distance vector

C. Route cost

D. Route priority

12) Each OSPF router floods LSAs to advertise link status information, including ( ). (Select 3 Answers)

A. Ports

B. Available neighbors

C. Information about adjacent network segments

D. Local link status information

13) Which of the following statements about an OSPF neighboring router are true? (Select 2
Answers)

A. An OSPF interface broadcast Hello packets to discover a neighbor.

B. After a router receives a Hello packet from the peer router, it becomes the neighbor of the peer
router.

C. After an OSPF router receives a Hello packet from the peer OSPF router, it checks the parameters
in the packet. If the parameters in the packet from the peer OSPF router are consistent with the
parameters of this OSPF rotuer, the two OSPF rotuers become neighbors of each other.

D. Neighbor discovery is equivalent to adjacency establishment

14) The shortest path tree calculated by a router in an OSPF area provides ( ) on the path from this
router to router nodes in the network.

A. All link states

B. Routing states

C. MAC address table

D. ARP table

15) Assume that the router has learnt the best route to the same destination by using RIP, OSPF,
BGP and Static Route respectively. By default, Huawei router will select the route learnt from ( ) as
the best route.

A. RIP

B. OSPF
C. BGP

D. Static rotue

16) Which of the following network types are supported by OSPF? (Select 3 Answers)

A. Point-to-Point

B. Point-to-Multipoint

C. Bus Topology

D. Broadcast

17) OSPF has experienced serveral versions. Which of the following versions is experiemental and has
never been deployed?

A. OSPFv1

B. OSPFv2

C. OSPFv3

D. OSPFv4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy