SlideShare a Scribd company logo
1 of 17
Download to read offline
1.
What is always required for OSPF routers to share routing information?
designated routers
a backup designated router
neighbor adjacencies
an NBMA network topology
links that are configured on the 224.0.0.0 network
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
2.
If a network has converged, what is true about the link-state database held by each router in the same OSPF
area?
Each router has a link-state database containing the same status information.
Each router has a different link-state database depending on its position within the network.
The link-state database is stored in a designated router and is accessed by each router in the area as needed
The link-state database in each router only contains information about adjacent routers and the status of th
links.
Scoring Rule For: correctness of response
2 points for Option 1
0 points for any other option
Max Value = 2
3.
Reset View
Reset View
Refer to the exhibit. RTRC was recently configured and is not sending the proper OSPF routes to RTRB, as
shown in the RTRB routing table. Based on the RTRC configuration, what is most likely the problem?
RTRC interfaces are administratively shut down.
The OSPF process ID for RTRC does not match the process ID used on RTRB.
The interface addresses on RTRC overlap with other addresses in the network.
The OSPF routing configuration on RTRC has a missing or incorrect network statement.
Scoring Rule For: correctness of response
Reset View
2 points for Option 4
0 points for any other option
Max Value = 2
4.
What is the primary difference between link-state protocols and distance vector protocols with regard to rout
calculation?
Distance vector protocols take existing routes from their neighbors and add to them. Link-state protocols
independently calculate full routes.
Link-state protocols calculate and pass full routing tables to all routers in their associated areas, and distan
vector protocols do not.
When determining invalid routes, link-state protocols use split horizon for all route computations. Distanc
vector protocols use reverse poisoning.
Distance vector protocols require more CPU and RAM for route calculations than link-state protocols requ
Scoring Rule For: correctness of response
2 points for Option 1
0 points for any other option
Max Value = 2
5.
Which two statements describe the operation of link-state routing protocols? (Choose two.)
All routers in the same area have identical link-state databases when converged.
Routing loops are prevented by running the Diffusing Update Algorithm (DUAL).
Link-state routers send frequent periodic updates of the entire routing table.
Reliable Transport Protocol (RTP) is used to deliver and receive LSAs.
Calculating the shortest path for each destination is accomplished with the SPF algorithm.
Scoring Rule For: correctness of response
Option 1 and Option 5 are correct.
1 point for each correct option.
0 points if more options are selected than required.
Max Value = 2
6.
Reset View
Reset View
Refer to the exhibit. The network administrator would like only the 172.16.32.0 network advertised to Rou
Which OSPF network command accomplishes this?
Router2(config-router)# network 172.16.0.0 0.0.0.15 area 0
Router2(config-router)# network 172.16.0.0 0.0.15.255 area 0
Router2(config-router)# network 172.16.32.0 0.0.15.255 area 0
Router2(config-router)# network 172.16.32.0 0.0.255.255 area 0
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
7.
Reset View
Refer to the exhibit. Routers A, B, and C are part of the existing OSPF network. Router D has been added to
network. All routers are running OSPF and have the indicated priorities applied to the interface. What is the
DR/BDR status immediately after router D is added to the existing network?
An election is forced and router D wins the DR election.
The DR and BDR do not change until the next election.
An election is forced and the existing BDR becomes the DR.
The router with the highest router ID becomes the new BDR.
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
8.
Reset View
Refer to the exhibit. The command ip route 10.16.1.64 255.255.255.252 s0/0/0 is entered into the router. Wh
network 10.16.1.64/30 appear in the routing table in addition to network 10.16.1.64/27?
The router views 10.16.1.64/30 and 10.16.1.64/27 as two different networks.
The static route is used as a backup route for packets destined for 10.16.1.64/27.
The AD for static routes is lower than the AD for OSPF routes.
The static route metric is lower than the OSPF metric for the 10.16.1.64/27 network.
Scoring Rule For: correctness of response
2 points for Option 1
0 points for any other option
Max Value = 2
9.
Which two statements describe the use of OSPF DR/BDR elections? (Choose two.)
Elections are always optional.
Elections are required in all WAN networks.
Elections are required in point-to-point networks.
Elections are required in broadcast multiaccess networks.
Elections are sometimes required in NBMA networks.
Scoring Rule For: correctness of response
Option 4 and Option 5 are correct.
1 point for each correct option.
0 points if more options are selected than required.
Max Value = 2
10.
Reset View
Reset View
Refer to the exhibit. Which router will be elected the DR and which will become the
BDR?
R1 will be DR and R2 will be BDR.
R1 will be DR and R3 will be BDR.
R2 will be DR and R1 will be BDR.
R2 will be DR and R3 will be BDR.
R3 will be DR and R2 will be BDR.
R3 will be DR and R1 will be BDR.
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
11.
Which statement is true regarding OSPF DR and BDR elections?
A new DR/BDR election occurs each time a new OSPF neighbor is added.
The router with the highest OSPF priority setting wins the election for DR.
The default priority value for a router connected to a multi-access network is 0.
The router with the highest MAC address is elected as the DR when the default priority values are used.
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
12.
Reset View
Reset View
Refer to the exhibit. What is the purpose of the configuration commands added on router B?
allows router A to form an adjacency with router B
provides a stable OSPF router ID on router B
provides a method of testing router traffic
creates the OSPF adjacency table on router B
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
13.
Reset View
Refer to the exhibit. When establishing adjacency relationships, which IP address would router A use to send
hello packets to router B?
10.11.0.1
10.11.0.2
10.11.0.255
224.0.0.5
255.255.255.255
Scoring Rule For: correctness of response
2 points for Option 4
0 points for any other option
Max Value = 2
14.
Reset View
Refer to the exhibit. What statement describes the DR/BDR relationship of the HQ router?
HQ is the DR.
HQ is the BDR.
HQ is a DROTHER.
HQ is a member of an NBMA network.
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
15.
Refer to the exhibit. Which network statement configures the home router to allow all the interfaces to
participate in OSPF?
network 10.0.0.0 0.3.255.255 area 0
network 10.8.0.0 0.0.0.3 area 0
network 10.8.0.0 0.3.255.255 area 0
network 10.10.0.0 0.0.0.3 area 0
network 10.12.0.0 0.3.255.255 area 0
Reset View
Reset View
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
16.
Refer to the exhibit. Which commands configure router A for OSPF?
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
17.
What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol?
Reset View
(Choose two.)
The topology database eliminates the need for a routing table.
Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.
Routers have direct knowledge of all links in the network and how they are connected.
After the initial LSA flooding, routers generally require less bandwidth to communicate changes in a
topology.
A link-state routing protocol requires less router processor power.
Scoring Rule For: correctness of response
Option 3 and Option 4 are correct.
1 point for each correct option.
0 points if more options are selected than required.
Max Value = 2
18.
What range of networks are advertised in the OSPF updates by the command Router1(config-router)# netw
192.168.0.0 0.0.15.255 area 0?
192.168.0.0/24 through 192.168.0.15/24
192.168.0.0/24 through 192.168.15.0/24
192.168.15.0/24 through 192.168.31.0/24
192.168.15.0/24 through 192.168.255.0/24
192.168.16.0/24 through 192.168.255.0/24
Scoring Rule For: correctness of response
2 points for Option 2
0 points for any other option
Max Value = 2
19.
Which two features are associated with Frame Relay OSPF point-to-multipoint environments? (Choose two.
A DR is not elected.
The OSPF priority value determines the active DR on the Frame Relay link.
OSPF neighbor routers are statically defined.
The link types are identified as broadcast multiaccess.
The BDR will have a router ID whose value is greater than the DR router ID.
Scoring Rule For: correctness of response
Reset View
Reset View
Reset View
Option 1 and Option 3 are correct.
1 point for each correct option.
0 points if more options are selected than required.
Max Value = 2
20.
Refer to the exhibit. How was the OSPF default gateway entry for R2 determined?
Default routes are automatically injected by OSPF into all advertisements.
A static default gateway route is defined in the configuration of R2.
The default-information originate command is applied on R1.
The ISP defines the gateway of last resort and automatically passes it to R1 and R2.
The ip default-gateway command is applied on R2.
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
21.
Reset View
Refer to the exhibit. As part of an OSPF network, R1 and R2 are trying to become adjacent neighbors. Altho
it appears that the two systems are communicating, neither of the routing tables include OSPF routes receive
from its neighbor. What could be responsible for this situation?
R1 and R2 are not on the same subnet.
The Process IDs on each router do not match.
The timer intervals on the routers do not match.
The value set for the Transmit Delay time on both routers is too low.
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
22.
Refer to the exhibit. What is the purpose of the value 128 shown in bold?
Reset View
It is the OSPF cost metric.
It is the OSPF administrative distance.
It is the value assigned by the Dijkstra algorithm that designates the distance in hops to the network.
It is the value assigned to an interface that is used by the DUAL algorithm to determine the metric.
Scoring Rule For: correctness of response
2 points for Option 1
0 points for any other option
23.
When compared to a distance vector routing protocol, what is a benefit of the hierarchical design approach th
is used in large OSPF networks?
simpler configuration
reduction of router processing requirements
isolation of network instability
less complex network planning
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
24.
When compared to a distance vector routing protocol, what is a benefit of the hierarchical design approach th
is used in large OSPF networks?
simpler configuration
reduction of router processing requirements
isolation of network instability
less complex network planning
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
Reset View
Reset View
Reset View
Refer to the exhibit. A network administrator has implemented OSPF and the network has co
router interfaces are enabled and functional, what route will OSPF view as lowest cost when
from Host3 to Host1?
R3 to R4 to R1
R3 to R1
R3 to R2 to R1
R3 to R5 to R2 to R1
Scoring Rule For: correctness of response
2 points for Option 3
0 points for any other option
Max Value = 2
Close Window
All contents copyright ©2001-2008 Cisco Systems, Inc. All rights reserved. Privacy Statement
and Trademarks.
Reset View

More Related Content

What's hot

OPEN SHORTEST PATH FIRST (OSPF)
OPEN SHORTEST PATH FIRST (OSPF)OPEN SHORTEST PATH FIRST (OSPF)
OPEN SHORTEST PATH FIRST (OSPF)Ann Joseph
 
Open Shortest Path First
Open Shortest Path FirstOpen Shortest Path First
Open Shortest Path FirstAtakan ATAK
 
Virtual Local Area Network
Virtual Local Area NetworkVirtual Local Area Network
Virtual Local Area NetworkAtakan ATAK
 
Network layer
Network layerNetwork layer
Network layersbkbca
 
ospf routing protocol
ospf routing protocolospf routing protocol
ospf routing protocolAmeer Agel
 
Design and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless NetworksDesign and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless NetworksSatish Reddy
 
Ccna 3-discovery-4-0-module-3-100-
Ccna 3-discovery-4-0-module-3-100-Ccna 3-discovery-4-0-module-3-100-
Ccna 3-discovery-4-0-module-3-100-junkut3
 
Concept of Network Routing Layer
Concept of Network Routing LayerConcept of Network Routing Layer
Concept of Network Routing LayerPawan Singh
 
OSPF (Open Shortest Path First) Case Study: Anil Nembang
OSPF (Open Shortest Path First) Case Study: Anil NembangOSPF (Open Shortest Path First) Case Study: Anil Nembang
OSPF (Open Shortest Path First) Case Study: Anil NembangAnil Nembang
 
Ars msr 1-intradomain
Ars msr 1-intradomainArs msr 1-intradomain
Ars msr 1-intradomainNarcisIlie1
 
Ccna 2 chapter 10 v4.0 answers 2011
Ccna 2 chapter 10 v4.0 answers 2011Ccna 2 chapter 10 v4.0 answers 2011
Ccna 2 chapter 10 v4.0 answers 2011Dân Chơi
 
Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011Dân Chơi
 

What's hot (20)

OPEN SHORTEST PATH FIRST (OSPF)
OPEN SHORTEST PATH FIRST (OSPF)OPEN SHORTEST PATH FIRST (OSPF)
OPEN SHORTEST PATH FIRST (OSPF)
 
Ch22
Ch22Ch22
Ch22
 
Open Shortest Path First
Open Shortest Path FirstOpen Shortest Path First
Open Shortest Path First
 
Virtual Local Area Network
Virtual Local Area NetworkVirtual Local Area Network
Virtual Local Area Network
 
Network Layer
Network LayerNetwork Layer
Network Layer
 
M odul1
M odul1M odul1
M odul1
 
Ospf
OspfOspf
Ospf
 
Routing Protocols
Routing ProtocolsRouting Protocols
Routing Protocols
 
Routing
RoutingRouting
Routing
 
Network layer
Network layerNetwork layer
Network layer
 
ospf routing protocol
ospf routing protocolospf routing protocol
ospf routing protocol
 
Design and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless NetworksDesign and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless Networks
 
Ccna 3-discovery-4-0-module-3-100-
Ccna 3-discovery-4-0-module-3-100-Ccna 3-discovery-4-0-module-3-100-
Ccna 3-discovery-4-0-module-3-100-
 
Ospf
OspfOspf
Ospf
 
Concept of Network Routing Layer
Concept of Network Routing LayerConcept of Network Routing Layer
Concept of Network Routing Layer
 
OSPF (Open Shortest Path First) Case Study: Anil Nembang
OSPF (Open Shortest Path First) Case Study: Anil NembangOSPF (Open Shortest Path First) Case Study: Anil Nembang
OSPF (Open Shortest Path First) Case Study: Anil Nembang
 
Ars msr 1-intradomain
Ars msr 1-intradomainArs msr 1-intradomain
Ars msr 1-intradomain
 
Ccna 2 chapter 10 v4.0 answers 2011
Ccna 2 chapter 10 v4.0 answers 2011Ccna 2 chapter 10 v4.0 answers 2011
Ccna 2 chapter 10 v4.0 answers 2011
 
Lecture 15
Lecture 15Lecture 15
Lecture 15
 
Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011
 

Similar to Ccna 3-discovery-4-0-module-6-100-

Ccna 3-discovery-4-0-module-7-100-
Ccna 3-discovery-4-0-module-7-100-Ccna 3-discovery-4-0-module-7-100-
Ccna 3-discovery-4-0-module-7-100-junkut3
 
3606765 ccna4-discovery-exam-8
3606765 ccna4-discovery-exam-83606765 ccna4-discovery-exam-8
3606765 ccna4-discovery-exam-8carlosedu11
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100junkut3
 
E routing final exam ccna 2 46
E routing final exam ccna 2 46E routing final exam ccna 2 46
E routing final exam ccna 2 46lslsc
 
Cisco discovery drs ent module 10 - v.4 in english.
Cisco discovery   drs ent module 10 - v.4 in english.Cisco discovery   drs ent module 10 - v.4 in english.
Cisco discovery drs ent module 10 - v.4 in english.igede tirtanata
 
Ccna 3-discovery-4-0-module-4-100-
Ccna 3-discovery-4-0-module-4-100-Ccna 3-discovery-4-0-module-4-100-
Ccna 3-discovery-4-0-module-4-100-junkut3
 
Day 8 1 introducing routing n
Day 8 1 introducing routing nDay 8 1 introducing routing n
Day 8 1 introducing routing nCYBERINTELLIGENTS
 
Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011Dân Chơi
 
Ccna 3 Final V4.0 Answers
Ccna 3 Final V4.0 AnswersCcna 3 Final V4.0 Answers
Ccna 3 Final V4.0 Answersccna4discovery
 
Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011Dân Chơi
 
Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011Dân Chơi
 
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docx
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docxITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docx
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docxsleeperfindley
 
Ccna 3 Chapter 6 V4.0 Answers
Ccna 3 Chapter 6 V4.0 AnswersCcna 3 Chapter 6 V4.0 Answers
Ccna 3 Chapter 6 V4.0 Answersccna4discovery
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010irbas
 

Similar to Ccna 3-discovery-4-0-module-6-100- (20)

Ccna 3-discovery-4-0-module-7-100-
Ccna 3-discovery-4-0-module-7-100-Ccna 3-discovery-4-0-module-7-100-
Ccna 3-discovery-4-0-module-7-100-
 
3606765 ccna4-discovery-exam-8
3606765 ccna4-discovery-exam-83606765 ccna4-discovery-exam-8
3606765 ccna4-discovery-exam-8
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100
 
E routing final exam ccna 2 46
E routing final exam ccna 2 46E routing final exam ccna 2 46
E routing final exam ccna 2 46
 
Cisco discovery drs ent module 10 - v.4 in english.
Cisco discovery   drs ent module 10 - v.4 in english.Cisco discovery   drs ent module 10 - v.4 in english.
Cisco discovery drs ent module 10 - v.4 in english.
 
Ccna 3-discovery-4-0-module-4-100-
Ccna 3-discovery-4-0-module-4-100-Ccna 3-discovery-4-0-module-4-100-
Ccna 3-discovery-4-0-module-4-100-
 
ivesgimpaya2
ivesgimpaya2ivesgimpaya2
ivesgimpaya2
 
ivesgimpaya3
ivesgimpaya3ivesgimpaya3
ivesgimpaya3
 
1 using default
1 using default1 using default
1 using default
 
1 using default
1 using default1 using default
1 using default
 
Day 8 1 introducing routing n
Day 8 1 introducing routing nDay 8 1 introducing routing n
Day 8 1 introducing routing n
 
Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011
 
Routing
RoutingRouting
Routing
 
Ccna 3 Final V4.0 Answers
Ccna 3 Final V4.0 AnswersCcna 3 Final V4.0 Answers
Ccna 3 Final V4.0 Answers
 
Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011
 
CCNA 1 Chapter 5 v5.0 2014
CCNA 1 Chapter 5 v5.0 2014CCNA 1 Chapter 5 v5.0 2014
CCNA 1 Chapter 5 v5.0 2014
 
Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011
 
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docx
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docxITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docx
ITNE2003 -  AssignmentLearning ObjectivesUpon completion of this.docx
 
Ccna 3 Chapter 6 V4.0 Answers
Ccna 3 Chapter 6 V4.0 AnswersCcna 3 Chapter 6 V4.0 Answers
Ccna 3 Chapter 6 V4.0 Answers
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010
 

Ccna 3-discovery-4-0-module-6-100-

  • 1. 1. What is always required for OSPF routers to share routing information? designated routers a backup designated router neighbor adjacencies an NBMA network topology links that are configured on the 224.0.0.0 network Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 2. If a network has converged, what is true about the link-state database held by each router in the same OSPF area? Each router has a link-state database containing the same status information. Each router has a different link-state database depending on its position within the network. The link-state database is stored in a designated router and is accessed by each router in the area as needed The link-state database in each router only contains information about adjacent routers and the status of th links. Scoring Rule For: correctness of response 2 points for Option 1 0 points for any other option Max Value = 2 3. Reset View Reset View
  • 2. Refer to the exhibit. RTRC was recently configured and is not sending the proper OSPF routes to RTRB, as shown in the RTRB routing table. Based on the RTRC configuration, what is most likely the problem? RTRC interfaces are administratively shut down. The OSPF process ID for RTRC does not match the process ID used on RTRB. The interface addresses on RTRC overlap with other addresses in the network. The OSPF routing configuration on RTRC has a missing or incorrect network statement. Scoring Rule For: correctness of response Reset View
  • 3. 2 points for Option 4 0 points for any other option Max Value = 2 4. What is the primary difference between link-state protocols and distance vector protocols with regard to rout calculation? Distance vector protocols take existing routes from their neighbors and add to them. Link-state protocols independently calculate full routes. Link-state protocols calculate and pass full routing tables to all routers in their associated areas, and distan vector protocols do not. When determining invalid routes, link-state protocols use split horizon for all route computations. Distanc vector protocols use reverse poisoning. Distance vector protocols require more CPU and RAM for route calculations than link-state protocols requ Scoring Rule For: correctness of response 2 points for Option 1 0 points for any other option Max Value = 2 5. Which two statements describe the operation of link-state routing protocols? (Choose two.) All routers in the same area have identical link-state databases when converged. Routing loops are prevented by running the Diffusing Update Algorithm (DUAL). Link-state routers send frequent periodic updates of the entire routing table. Reliable Transport Protocol (RTP) is used to deliver and receive LSAs. Calculating the shortest path for each destination is accomplished with the SPF algorithm. Scoring Rule For: correctness of response Option 1 and Option 5 are correct. 1 point for each correct option. 0 points if more options are selected than required. Max Value = 2 6. Reset View Reset View
  • 4. Refer to the exhibit. The network administrator would like only the 172.16.32.0 network advertised to Rou Which OSPF network command accomplishes this? Router2(config-router)# network 172.16.0.0 0.0.0.15 area 0 Router2(config-router)# network 172.16.0.0 0.0.15.255 area 0 Router2(config-router)# network 172.16.32.0 0.0.15.255 area 0 Router2(config-router)# network 172.16.32.0 0.0.255.255 area 0 Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 7. Reset View
  • 5. Refer to the exhibit. Routers A, B, and C are part of the existing OSPF network. Router D has been added to network. All routers are running OSPF and have the indicated priorities applied to the interface. What is the DR/BDR status immediately after router D is added to the existing network? An election is forced and router D wins the DR election. The DR and BDR do not change until the next election. An election is forced and the existing BDR becomes the DR. The router with the highest router ID becomes the new BDR. Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 8. Reset View
  • 6. Refer to the exhibit. The command ip route 10.16.1.64 255.255.255.252 s0/0/0 is entered into the router. Wh network 10.16.1.64/30 appear in the routing table in addition to network 10.16.1.64/27? The router views 10.16.1.64/30 and 10.16.1.64/27 as two different networks. The static route is used as a backup route for packets destined for 10.16.1.64/27. The AD for static routes is lower than the AD for OSPF routes. The static route metric is lower than the OSPF metric for the 10.16.1.64/27 network. Scoring Rule For: correctness of response 2 points for Option 1 0 points for any other option Max Value = 2 9. Which two statements describe the use of OSPF DR/BDR elections? (Choose two.) Elections are always optional. Elections are required in all WAN networks. Elections are required in point-to-point networks. Elections are required in broadcast multiaccess networks. Elections are sometimes required in NBMA networks. Scoring Rule For: correctness of response Option 4 and Option 5 are correct. 1 point for each correct option. 0 points if more options are selected than required. Max Value = 2 10. Reset View Reset View
  • 7.
  • 8. Refer to the exhibit. Which router will be elected the DR and which will become the BDR? R1 will be DR and R2 will be BDR. R1 will be DR and R3 will be BDR. R2 will be DR and R1 will be BDR. R2 will be DR and R3 will be BDR. R3 will be DR and R2 will be BDR. R3 will be DR and R1 will be BDR. Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 11. Which statement is true regarding OSPF DR and BDR elections? A new DR/BDR election occurs each time a new OSPF neighbor is added. The router with the highest OSPF priority setting wins the election for DR. The default priority value for a router connected to a multi-access network is 0. The router with the highest MAC address is elected as the DR when the default priority values are used. Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 12. Reset View Reset View
  • 9. Refer to the exhibit. What is the purpose of the configuration commands added on router B? allows router A to form an adjacency with router B provides a stable OSPF router ID on router B provides a method of testing router traffic creates the OSPF adjacency table on router B Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 13. Reset View
  • 10. Refer to the exhibit. When establishing adjacency relationships, which IP address would router A use to send hello packets to router B? 10.11.0.1 10.11.0.2 10.11.0.255 224.0.0.5 255.255.255.255 Scoring Rule For: correctness of response 2 points for Option 4 0 points for any other option Max Value = 2 14. Reset View
  • 11. Refer to the exhibit. What statement describes the DR/BDR relationship of the HQ router? HQ is the DR. HQ is the BDR. HQ is a DROTHER. HQ is a member of an NBMA network. Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 15. Refer to the exhibit. Which network statement configures the home router to allow all the interfaces to participate in OSPF? network 10.0.0.0 0.3.255.255 area 0 network 10.8.0.0 0.0.0.3 area 0 network 10.8.0.0 0.3.255.255 area 0 network 10.10.0.0 0.0.0.3 area 0 network 10.12.0.0 0.3.255.255 area 0 Reset View Reset View
  • 12. Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 16. Refer to the exhibit. Which commands configure router A for OSPF? Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 17. What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? Reset View
  • 13. (Choose two.) The topology database eliminates the need for a routing table. Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database. Routers have direct knowledge of all links in the network and how they are connected. After the initial LSA flooding, routers generally require less bandwidth to communicate changes in a topology. A link-state routing protocol requires less router processor power. Scoring Rule For: correctness of response Option 3 and Option 4 are correct. 1 point for each correct option. 0 points if more options are selected than required. Max Value = 2 18. What range of networks are advertised in the OSPF updates by the command Router1(config-router)# netw 192.168.0.0 0.0.15.255 area 0? 192.168.0.0/24 through 192.168.0.15/24 192.168.0.0/24 through 192.168.15.0/24 192.168.15.0/24 through 192.168.31.0/24 192.168.15.0/24 through 192.168.255.0/24 192.168.16.0/24 through 192.168.255.0/24 Scoring Rule For: correctness of response 2 points for Option 2 0 points for any other option Max Value = 2 19. Which two features are associated with Frame Relay OSPF point-to-multipoint environments? (Choose two. A DR is not elected. The OSPF priority value determines the active DR on the Frame Relay link. OSPF neighbor routers are statically defined. The link types are identified as broadcast multiaccess. The BDR will have a router ID whose value is greater than the DR router ID. Scoring Rule For: correctness of response Reset View Reset View Reset View
  • 14. Option 1 and Option 3 are correct. 1 point for each correct option. 0 points if more options are selected than required. Max Value = 2 20. Refer to the exhibit. How was the OSPF default gateway entry for R2 determined? Default routes are automatically injected by OSPF into all advertisements. A static default gateway route is defined in the configuration of R2. The default-information originate command is applied on R1. The ISP defines the gateway of last resort and automatically passes it to R1 and R2. The ip default-gateway command is applied on R2. Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 21. Reset View
  • 15. Refer to the exhibit. As part of an OSPF network, R1 and R2 are trying to become adjacent neighbors. Altho it appears that the two systems are communicating, neither of the routing tables include OSPF routes receive from its neighbor. What could be responsible for this situation? R1 and R2 are not on the same subnet. The Process IDs on each router do not match. The timer intervals on the routers do not match. The value set for the Transmit Delay time on both routers is too low. Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 22. Refer to the exhibit. What is the purpose of the value 128 shown in bold? Reset View
  • 16. It is the OSPF cost metric. It is the OSPF administrative distance. It is the value assigned by the Dijkstra algorithm that designates the distance in hops to the network. It is the value assigned to an interface that is used by the DUAL algorithm to determine the metric. Scoring Rule For: correctness of response 2 points for Option 1 0 points for any other option 23. When compared to a distance vector routing protocol, what is a benefit of the hierarchical design approach th is used in large OSPF networks? simpler configuration reduction of router processing requirements isolation of network instability less complex network planning Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 24. When compared to a distance vector routing protocol, what is a benefit of the hierarchical design approach th is used in large OSPF networks? simpler configuration reduction of router processing requirements isolation of network instability less complex network planning Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 Reset View Reset View Reset View
  • 17. Refer to the exhibit. A network administrator has implemented OSPF and the network has co router interfaces are enabled and functional, what route will OSPF view as lowest cost when from Host3 to Host1? R3 to R4 to R1 R3 to R1 R3 to R2 to R1 R3 to R5 to R2 to R1 Scoring Rule For: correctness of response 2 points for Option 3 0 points for any other option Max Value = 2 Close Window All contents copyright ©2001-2008 Cisco Systems, Inc. All rights reserved. Privacy Statement and Trademarks. Reset View