Answer: D 

Explanation: 

The routing table contains network/next hop associations. These associations tell a router that a particular destination can be optimally reached by sending the packet to a specific router that represents the "next hop" on the way to the final destination. The next hop association can also be the outgoing or exit interface to the final destination. 

Answer: A 

Reference: 

http://www.cisco.com/en/US/docs/security/asa/asa82/configuration/guide/nat_staticpat.html 

Static PAT translations allow a specific UDP or TCP port on a global address to be translated to a specific port on a local address. That is, both the address and the port numbers are translated. 

Static PAT is the same as static NAT, except that it enables you to specify the protocol (TCP or UDP) and port for the real and mapped addresses. Static PAT enables you to identify the same mapped address across many different static statements, provided that the port is different for each statement. You cannot use the same mapped address for multiple static NAT statements. 

Port Address Translation makes the PC connect to the Internet but using different TCP source port. 

Answer: E 

Explanation: 

For packets destined to a host on another IP network, the destination MAC address will be the LAN interface of the router. Since the FTP server lies on a different network, the host will know to send the frame to its default gateway, which is Toronto. 

Answer: A,C 

Explanation: 

Reference 1: http://www.ciscopress.com/articles/article.asp?p=24090&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'a shortest path algorithm. Examples of link state routing protocols are: Open Shortest Path First (OSPF) for IP The ISO's Intermediate System to Intermediate System (IS-IS) for CLNS and IP DEC's DNA Phase V Novell'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: 

1.

 Each router establishes a relationship—an adjacency—with each of its neighbors. 

2.

 Each router sends link state advertisements (LSAs), some 

3.

 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. 

4.

 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. OSPF Tutorial 

Answer: B,C 

Explanation: 

OSPF uses a LSDB (link state database) and fills this with LSAs (link state advertisement). The link types are as follows: 

. LSA Type 1: Router LSA 

....... 

LSA Type 2: Network LSA 

LSA Type 3: Summary LSA 

LSA Type 4: Summary ASBR LSA 

LSA Type 5: Autonomous system external LSA 

LSA Type 6: Multicast OSPF LSA 

LSA Type 7: Not-so-stubby area LSA 

LSA Type 8: External attribute LSA for BGP 

If all routers are in the same area, then many of these LSA types (Summary ASBR LSA, external LSA, etc) will not be used and will not be generated by any router. 

All areas in an Open Shortest Path First (OSPF) autonomous system must be physically connected to the backbone area (Area 0). In some cases, where this is not possible, you can use a virtual link to connect to the backbone through a non-backbone area. You can also use virtual links to connect two parts of a partitioned backbone through a non-backbone area. The area through which you configure the virtual link, known as a transit area, must have full routing information. The transit area cannot be a stub area. Virtual links are not ideal and should really only be used for temporary network solutions or migrations. However, if all locations are in a single OSPF area this is not needed. 

Answer: C 

Explanation: 

Convert bit-length prefix to quad-dotted decimal representation, then from it find the number of bits used for subnetting you can find previously calculated number of subnets by separating subnets each having value of last bit used for subnet masking Find that your IP address is in which subnet, that subnet's first address is network address and last address is broadcast address. Based on above steps the answer is option C 

Answer: B 

Explanation: 

First, notice that the more-specific routes will always be favored over less-specific routes regardless of the administrative distance set for a protocol. In this case, because we use OSPF for three networks (172.16.100.0 0.0.0.3, 172.16.100.64 0.0.0.63, 172.16.100.128 0.0.0.31) so the packets destined for these networks will not be affected by the default route. The default route configured on R1 “ip route 0.0.0.0 0.0.0.0 serial0/0 will send any packet whose destination network is not referenced in the routing table of router R1 to R2, it doesn’t drop anything. These routes are declared in R1 and the question says that “OSPF has been correctly configured on router R2, so network directly connected to router R2 can communicate with those three subnetworks. As said above, the default route configured on R1 will send any packet destined for a network that is not referenced in its routing table to R2; R2 in turn sends it to R1 because it is the only way and a routing loop will occur. 

Answer: A 

Explanation: 

Administrative distance - This is the measure of trustworthiness of the source of the 

route. If a router learns about a destination from more than one routing protocol, 

administrative distance is compared and the preference is given to the routes with lower 

administrative distance. In other words, it is the believability of the source of the route. 

Answer: D 

Explanation: 

Its best to use static addressing scheme where the number of systems is manageable rather than using a dynamic method such as DHCP as it is easy to operate and manage. 

Answer: B 

Explanation: You can use the passive-interface command in order to control the advertisement of routing information. The command enables the suppression of routing updates over some interfaces while it allows updates to be exchanged normally over other interfaces. With most routing protocols, the passive-interface command restricts outgoing advertisements only. But, when used with Enhanced Interior Gateway Routing Protocol (EIGRP), the effect is slightly different. This document demonstrates that use of the passive-interface command in EIGRP suppresses the exchange of hello packets between two routers, which results in the loss of their neighbor relationship. This stops not only routing updates from being advertised, but it also suppresses incoming routing updates. This document also discusses the configuration required in order to allow the suppression of outgoing routing updates, while it also allows incoming routing updates to be learned normally from the neighbor.