Ensurepass.com : Ensure you pass the IT Exams
2018 Jan Cisco Official New Released 200-105
100% Free Download! 100% Pass Guaranteed!
http://www.EnsurePass.com/200-105.html
Interconnecting Cisco Networking Devices Part 2 (ICND2 v3.0)
Question No: 81 – (Topic 3)
What can be done to secure the virtual terminal interfaces on a router? (Choose two.)
-
Administratively shut down the interface.
-
Physically secure the interface.
-
Create an access list and apply it to the virtual terminal interfaces with the access-group command.
-
Configure a virtual terminal password and login process.
-
Enter an access list and apply it to the virtual terminal interfaces using the access-class command.
Answer: D,E Explanation:
It is a waste to administratively shut down the interface. Moreover, someone can still access the virtual terminal interfaces via other interfaces -gt; A is not correct.
We can not physically secure a virtual interface because it is “virtual” -gt; B is not correct. To apply an access list to a virtual terminal interface we must use the “access-class” command. The “access-group” command is only used to apply an access list to a physical interface -gt; C is not correct; E is correct.
The most simple way to secure the virtual terminal interface is to configure a username amp; password to prevent unauthorized login -gt; D is correct.
Question No: 82 DRAG DROP – (Topic 3)
Answer:
Explanation:
Enhanced Interior Gateway Routing Protocol (EIGRP) is a Cisco proprietary routing protocol, so it is vendor-specific. By default, EIGRP internal routes have an administrative distance value of 90.
OSPF uses cost as its metric. By default, the cost of an interface is calculated based on
bandwidth with the formula cost= 10000 0000/bandwidth (in bps). OSPF elects a DR on each broadcast and nonbroadcast multiaccess networks (like Ethernet and Frame Relay environments, respectively). It doesn’t elect a DR on point-to-point link (like a serial WAN).
Question No: 83 – (Topic 3)
Refer to the exhibit.
The network is converged. After link-state advertisements are received from Router_A, what information will Router_E contain in its routing table for the subnets 208.149.23.64 and 208.149.23.96?
A. O 208.149.23.64 [110/13] via 190.173.23.10, 00:00:07, FastEthernet 0/0
O 208.149.23.96 [110/13] via 190.173.23.10, 00:00:16, FastEthernet 0/0
B. O 208.149.23.64 [110/1] via 190.172.23.10, 00:00:07, Serial 1/0
O 208.149.23.96 [110/3] via 190.173.23.10, 00:00:16, FastEthernet 0/0
C. O 208.149.23.64 [110/13] via 190.172.23.10, 00:00:07, Serial 1/0
O 208.149.23.96 [110/13] via 190.172.23.10, 00:00:16, Serial 1/0
O 208.149.23.96 [110/13] via 190.173.23.10, 00:00:16, FastEthernet 0/0
D. O 208.149.23.64 [110/3] via 190.172.23.10, 00:00:07, Serial 1/0
O 208.149.23.96 [110/3] via 190.172.23.10, 00:00:16, Serial 1/0
Answer: A
Explanation:
Router_E learns two subnets subnets 208.149.23.64 and 208.149.23.96 via Router_A through FastEthernet interface. The interface cost is calculated with the formula 108 / Bandwidth. For FastEthernet it is 108 / 100 Mbps = 108 / 100,000,000 = 1. Therefore the cost is 12 (learned from Router_A) 1 = 13 for both subnets – B is not correct.
The cost through T1 link is much higher than through T3 link (T1 cost = 108 / 1.544 Mbps = 64; T3 cost = 108 / 45 Mbps = 2) so surely OSPF will choose the path through T3 link -gt; Router_E will choose the path from Router_A through FastEthernet0/0, not Serial1/0 – C amp; D are not correct.
In fact, we can quickly eliminate answers B, C and D because they contain at least one subnet learned from Serial1/0 – they are surely incorrect.
Question No: 84 – (Topic 3)
Refer to the exhibit.
If the router Cisco returns the given output and has not had its router ID set manually, what value will OSPF use as its router ID?
A. 192.168.1.1
B. 172.16.1.1
C. 1.1.1.1
D. 2.2.2.2
Answer: D Explanation:
If a router-id is not configured manually in the OSPF routing process the router will automatically configure a router-id determined from the highest IP address of a logical interface (loopback interface) or the highest IP address of an active interface. If more than one loopback interfaces are configured, the router will compare the IP addresses of each of the interfaces and choose the highest IP address from the loopbacks.
Question No: 85 – (Topic 3)
The internetwork infrastructure of company XYZ consists of a single OSPF area as shown in the graphic. There is concern that a lack of router resources is impeding internetwork performance. As part of examining the router resources, the OSPF DRs need to be known. All the router OSPF priorities are at the default and the router IDs are shown with each router.
Which routers are likely to have been elected as DR? (Choose two.)
-
Corp-1
-
Corp-2
-
Corp-3
-
Corp-4
-
Branch-1
-
Branch-2
Answer: D,F
Explanation: There are 2 segments on the topology above which are separated by Corp-3 router. Each segment will have a DR so we have 2 DRs.
To select which router will become DR they will compare their router-IDs. The router with highest (best) router-ID will become DR. The router-ID is chosen in the order below:
The highest IP address assigned to a loopback (logical) interface.
If a loopback interface is not defined, the highest IP address of all active router’s physical interfaces will be chosen.
In this question, the IP addresses of loopback interfaces are not mentioned so we will consider IP addresses of all active router’s physical interfaces. Router Corp-4 (10.1.40.40)
amp; Branch-2 (10.2.20.20) have highest “active” IP addresses so they will become DRs.
Question No: 86 – (Topic 3)
What information does a router running a link-state protocol use to build and maintain its topological database? (Choose two.)
-
hello packets
-
SAP messages sent by other routers
-
LSAs from other routers
-
beacons received on point-to-point links
-
routing tables received from other link-state routers
-
TTL packets from designated routers
Answer: A,C Explanation:
Link State Routing Protocols http://www.ciscopress.com/articles/article.asp?p=24090amp;seqNum=4
Link state protocols, sometimes called shortest path first or distributed database protocols, are built around a well-known algorithm from graph theory, E. W. Dijkstra#39;a shortest path algorithm. Examples of link state routing protocols are:
Open Shortest Path First (OSPF) for IP
The ISO#39;s Intermediate System to Intermediate System (IS-IS) for CLNS and IP DEC#39;s DNA Phase V
Novell#39;s NetWare Link Services Protocol (NLSP)
Although link state protocols are rightly considered more complex than distance vector protocols, the basic functionality is not complex at all:
-
Each router establishes a relationship-an adjacency-with each of its neighbors.
-
Each router sends link state advertisements (LSAs), some
-
Each router stores a copy of all the LSAs it has seen in a database. If all works well, the databases in all routers should be identical.
-
The completed topological database, also called the link state database, describes a graph of the internetwork. Using the Dijkstra algorithm, each router calculates the shortest path to each network and enters this information into the route table.
Question No: 87 – (Topic 3)
A router receives information about network 192.168.10.0/24 from multiple sources. What will the router consider the most reliable information about the path to that network?
-
an OSPF update for network 192.168.0.0/16
-
a static route to network 192.168.10.0/24
-
a static route to network 192.168.10.0/24 with a local serial interface configured as the next hop
-
a RIP update for network 192.168.10.0/24
-
a directly connected interface with an address of 192.168.10.254/24
-
a default route with a next hop address of 192.168.10.1
-
-
Answer: E Explanation:
What Is Administrative Distance? http://www.cisco.com/en/US/tech/tk365/technologies_tech_note09186a0080094195.shtml
Select the Best Path
Administrative distance is the first criterion that a router uses to determine which routing protocol to use if two protocols provide route information for the same destination.
Administrative distance is a measure of the trustworthiness of the source of the routing information. Administrative distance has only local significance, and is not advertised in routing updates.
Note: The smaller the administrative distance value, the more reliable the protocol. For example, if a router receives a route to a certain network from both Open Shortest Path
First (OSPF) (default administrative distance – 110) and Interior Gateway Routing Protocol (IGRP) (default administrative distance – 100), the router chooses IGRP because IGRP is more reliable. This means the router adds the IGRP version of the route to the routing table.
Question No: 88 DRAG DROP – (Topic 3)
Answer:
Explanation:
holddown timer: prevents a router from improperly reinstating a route from a regular routing update
split horizon: prevents information about a route from being sent in the direction from which the route was learned
defining a maximum: prevents invalid updates from looping the internetwork indefinitely
route poisoning: causes a routing protocol to advertise an infinite metric for a failed route
triggered update: decreases convergence time by immediately sending route information in response to a topology change
Question No: 89 – (Topic 3)
Which statement describes the process ID that is used to run OSPF on a router?
-
It is globally significant and is used to represent the AS number.
-
It is locally significant and is used to identify an instance of the OSPF database.
-
It is globally significant and is used to identify OSPF stub areas.
-
It is locally significant and must be the same throughout an area.
Answer: B
Explanation: The Process ID for OSPF on a router is only locally significant and you can use the same number on each router, or each router can have a different number-it just doesn#39;t matter. The numbers you can use are from 1 to 65,535. Don#39;t get this confused with area numbers, which can be from 0 to 4.2 billion.
Question No: 90 – (Topic 3)
Which statements are true about EIGRP successor routes? (Choose two.)
-
A successor route is used by EIGRP to forward traffic to a destination.
-
Successor routes are saved in the topology table to be used if the primary route fails.
-
Successor routes are flagged as #39;active#39; in the routing table.
-
A successor route may be backed up by a feasible successor route.
-
Successor routes are stored in the neighbor table following the discovery process.
Answer: A,D Explanation:
Introduction to EIGRP http://www.cisco.com/en/US/tech/tk365/technologies_tech_note09186a0080093f07.shtml
Feasible Successors
A destination entry is moved from the topology table to the routing table when there is a feasible successor. All minimum cost paths to the destination form a set. From this set, the neighbors that have an advertised metric less than the current routing table metric are considered feasible successors.
Feasible successors are viewed by a router as neighbors that are downstream with respect to the destination.
These neighbors and the associated metrics are placed in the forwarding table.
When a neighbor changes the metric it has been advertising or a topology change occurs in the network, the set of feasible successors may have to be re-evaluated. However, this is not categorized as a route recomputation.
100% Ensurepass Free Download!
–Download Free Demo:200-105 Demo PDF
100% Ensurepass Free Guaranteed!
–200-105 Dumps
EnsurePass | ExamCollection | Testking | |
---|---|---|---|
Lowest Price Guarantee | Yes | No | No |
Up-to-Dated | Yes | No | No |
Real Questions | Yes | No | No |
Explanation | Yes | No | No |
PDF VCE | Yes | No | No |
Free VCE Simulator | Yes | No | No |
Instant Download | Yes | No | No |
100-105 Dumps VCE PDF
200-105 Dumps VCE PDF
300-101 Dumps VCE PDF
300-115 Dumps VCE PDF
300-135 Dumps VCE PDF
300-320 Dumps VCE PDF
400-101 Dumps VCE PDF
640-911 Dumps VCE PDF
640-916 Dumps VCE PDF
70-410 Dumps VCE PDF
70-411 Dumps VCE PDF
70-412 Dumps VCE PDF
70-413 Dumps VCE PDF
70-414 Dumps VCE PDF
70-417 Dumps VCE PDF
70-461 Dumps VCE PDF
70-462 Dumps VCE PDF
70-463 Dumps VCE PDF
70-464 Dumps VCE PDF
70-465 Dumps VCE PDF
70-480 Dumps VCE PDF
70-483 Dumps VCE PDF
70-486 Dumps VCE PDF
70-487 Dumps VCE PDF
220-901 Dumps VCE PDF
220-902 Dumps VCE PDF
N10-006 Dumps VCE PDF
SY0-401 Dumps VCE PDF