CCNA CCNP Interview Questions answers(Part-2)

2640

CCNA CCNP Interview Questions answers(Part-2)

ccna (3)

1.What does it mean when a route table says that an address is variably subnetted?

Answer: Variably subnetted means that the router knows of more than one subnet mask for subnets of the same major IP address.

2.What are discontiguous subnets?

Answer: Discontiguous subnets are two or more subnets of a major IP network address that are separated by a different major IP address.

3.What command is used to examine the route table in a Cisco router?

Answer: show ip route is used to examine the routing table of a Cisco router.

4.What are the two bracketed numbers associated with the non-directly connected routes in the route table?

Answer: The first bracketed number is the administrative distance of the routing protocol by which the route was learned. The second number is the metric of the route.

5.When static routes are configured to reference an exit interface instead of a next-hop address, in what way will the route table be different?

Answer: When a static route is configured to reference an exit interface instead of a next-hop address, the destination address will be entered into the routing table as directly connected.

6.What is a summary route? In the context of static routing, how are summary routes useful?

Answer: A summary route is a single route entry that points to multiple subnets or major IP addresses. In the context of static routes, summary routes can reduce the number of static routes that must be configured.

7.What is an administrative distance?

Answer: An administrative distance is a rating of preference for a routing protocol or a static route. Every routing protocol and every static route has an administrative distance associated with it. When a router learns of a destination via more than one routing protocol or static route, it will use the route with the lowest administrative distance.

8.What is a floating static route?

Answer: A floating static route is an alternative route to a destination. The administrative distance is set high enough that the floating static route is used only if a more-preferred route becomes unavailable.

9.What is the difference between equal-cost and unequal-cost load sharing?

Answer: Equal-cost load sharing distributes traffic equally among multiple paths with equal metrics.

Unequal-cost load sharing distributes packets among multiple paths with different metrics. The

traffic will be distributed inversely proportional to the cost of the routes.

10.How does the switching mode at an interface affect load sharing?

Answer: If an interface is fast switched, per destination load sharing is performed. If an interface is process switched, per packet load sharing is performed.

11.What is a recursive table lookup?

Answer: A recursive routing table lookup occurs when a router cannot acquire all the information it needs to forward a packet with a single routing table lookup. For example, the router may perform one lookup to find the route to a destination and then perform another lookup to find a route to the next hop router of the first route.

12.What is a routing protocol?

Answer: A routing protocol is a “language” that routers speak to each other to share information about network destinations.

13.What basic procedures should a routing algorithm perform?

Answer: At a minimum, a routing protocol should define procedures for:

Passing reachability information about networks to other routers

Receiving reachability information from other routers

Determining optimal routes based on the reachability information it has and for recording this information in a route table

Reacting to, compensating for, and advertising topology changes in an internetwork

14.Why do routing protocols use metrics?

Answer: A route metric, also called a route cost or a route distance, is used to determine the best path to a destination. Best is defined by the type of metric used.

15.What is convergence time?

Answer: Convergence time is the time a group of routers take to complete the exchange of routing

16.What is load balancing? Name four different types of load balancing.

Answer: Load balancing is the process of sending packets over multiple paths to the same destination. Four types of load balancing are:

Equal cost, per packet

Equal cost, per destination

Unequal cost, per packet

Unequal cost, per destination

17.What is a distance vector routing protocol?

Answer: A distance vector protocol is a routing protocol in which each router calculates routes based on the routes of its neighbors and then passes its routes to other neighbors.

18.Name several problems associated with distance vector protocols.

Answer: Several problems associated with distance vector protocols are:

A susceptibility to incorrect routing information because of its dependence on neighbors for correct information

Slow convergence

Route loops

Counting to infinity

19.What are neighbors?

Answer: Neighbors are routers connected to the same data link.

20.What is the purpose of route invalidation timers?

Answer: Route invalidation timers delete routes from a route table if they exceed a certain age.

21.Explain the difference between simple split horizon and split horizon with poisoned reverse?

Answer: Simple split horizon does not send route information back to the source of the route information. Split horizon with poisoned reverse sends the information back to the source but sets the metric to unreachable.

22.What is the counting-to-infinity problem, and how can it be controlled?

Answer: Counting to infinity occurs when routes update a route over a loop; each router increases the metric of the route until the metric reaches infinity. The effects of counting to infinity are controlled by defining infinity as a fairly low metric so that infinity is reached fairly quickly and the route is declared unreachable.

23.What are holddown timers, and how do they work?

Answer: Holddown timers help prevent routing loops. If a route is declared unreachable or if the metric increases beyond a certain threshold, a router will not accept any other information about that route until the hold down timer expires. This approach prevents the router from accepting possibly bad routing information while the internetwork is reconverging.

24.What are the differences between distance vector and link state routing protocols?

Answer: A distance vector router sends its entire route table, but it only sends the table to directly connected neighbors. A link state router sends only information about its directly connected links, but it floods the information throughout the internetworking area. Distance vector protocols usually use a variant of the Bellman-Ford algorithm to calculate routes, and link state protocols usually use a variant of the Dijkstra algorithm to calculate routes.

25.What is the purpose of a topological database?

Answer: A topological database holds the link state information originated by all routers in the link state routing domain.

26.Explain the basic steps involved in converging a link state internetwork.

Answer: Each router floods a link state information advertisement describing its links, the states of its links, and any neighboring routers connected to those links, throughout the internetworking area. All routers store all received copies of the link state advertisement in a link state database. Each router calculates a shortest path tree from the information in the topological database and enters routes in its routing tables based on the shortest path tree.

27.Why are sequence numbers important in link state protocols?

Answer: Sequence numbers help a router differentiate between multiple copies of the same link state advertisement and also prevent flooded link state advertisements from circulating endlessly throughout the internetwork.

28.What purpose does aging serve in a link state protocol?

A: Aging prevents old, possibly obsolete, link state information from residing in a topological database or from being accepted by a router.

29.Explain how an SPF algorithm works?

Answer: A router builds a shortest path tree by first adding itself as the root. Using the information in the topological database, the router creates a list of all of its directly connected neighbors. The lowest cost link to a neighbor becomes a branch of the tree, and that router’s neighbors are added to the list. The list is checked for duplicate paths, and if they exist, the higher-cost paths are removed from the list. The lowest-cost router on the list is added to the tree, that router’s neighbors are added to the list, and the list is again checked for duplicate paths. This process continues until no routers remain on the list.

30.How do areas benefit a link state internetwork?

Answer: Within a routing domain, areas are subdomains. They make link state routing more efficient by limiting the size of the link state database of each router in the area.

31.What is an autonomous system?

Answer: Depending on the usage, an autonomous system can be defined as an internetwork under a common administrative domain or a single routing domain.

32.What is the difference between an IGP and an EGP?

Answer: An Interior Gateway Protocol is a routing protocol that routes within an autonomous system. An Exterior Gateway Protocol is a routing protocol that routes between autonomous systems.

33.What port does RIP use?

Answer: RIP uses UDP port 520.

34.What metric does RIP use? How is the metric used to indicate an unreachable network?

Answer: RIP uses a hop count metric. An unreachable network is indicated by setting the hop count to 16, which RIP interprets as an infinite distance.

35.What is the update period for RIP?

Answer: RIP sends periodic updates every 30 seconds minus a small random variable to prevent the updates of neighboring routers from becoming synchronized.

36.How many updates must be missed before a route entry will be marked as unreachable?

Answer: A route entry is marked as unreachable if six updates are missed.

37.What is the purpose of the garbage collection timer?

Answer: The garbage collection timer, or flush timer, is set when a route is declared unreachable. When the timer expires, the route is flushed from the route table. This process allows an unreachable route to remain in the routing table long enough for neighbors to be notified of its status.

38.Why is a random timer associated with triggered updates? What is the range of this timer?

Answer: The random timer, whose range is 1 to 5 seconds, prevents a “storm” of triggered updates during a topology change.

39.What is the difference between a RIP Request message and a RIP Response message?

Answer: A Request message asks a router for an update. A Response message is an update.

40.Which two types of Request messages does RIP use?

Answer: A Request message may either ask for a full update or in some special cases it may ask for specific routes.

41.Under what circumstances will a RIP response be sent?

Answer: A Response is sent when the update timer expires, or upon reception of a Request message.

42.Why does RIP hide subnets at major network boundaries?

Answer: RIP updates do not include the subnet mask of the destination address, so a RIP router depends on the subnet masks of its own interfaces to determine how an attached major network address is subnetted. If a router does not have an attachment to a particular major network address, it has no way to know how that major network is subnetted. Therefore, no subnets of a major network address can be advertised into another major network.

43.Which UDP port number is used to access IGRP?

Answer: IGRP does not use a UDP port. It is accessed directly from the network layer, as protocol number 9.

44.What is the maximum IGRP internetwork diameter, in hops?

Answer: The maximum IGRP network diameter is 255 hops.

 

What’s your Reaction?
+1
0
+1
0
+1
0
+1
0
+1
0
+1
0
+1
0
Bijay
Hy i'm bijay.I'm someone who loves to enjoy life and tries to focus on real things and real friendships. That's why I live very simply. I don't spend much time fixing myself up or trying to look cool. I live like a normal person. Failure is the key to success; each mistake teaches us something. so friends plz forgive me if i do any mistake.