Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPE) in an IPv4 network. I. RIP uses distance vector routing II. RIP packets are sent using UDP III. OSPF packets are sent using TCP IV. OSPF operation is based on link-state routing Which of the statements above are CORRECT?
Which statement is true regarding classless routing protocols?
1. The use of discontiguous networks is not allowed.
2. The use of variable length subnet masks is permitted.
3. RIPv1 is a classless routing protocol.
4. IGRP supports classless routing within the same autonomous system.
5. RIPv2 supports classless routing.
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links. [S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol. Which one of the following is correct about S1, S2, and S3?
Your company is running IGRP using an AS of 10. You want to configure EIGRP on the network but want to migrate slowly to EIGRP and don't want to configure redistribution. What command would allow you to migrate over time to EIGRP without configuring redistribution?
To enable EIGRP, which of the following would you use?
1. Router1(config-if)# ipv6 ospf 10 area 0.0.0.0
2. Router1(config-if)# ipv6 router rip 1
3. Router1(config)# ipv6 router eigrp 10
4. Router1(config-rtr)# no shutdown
5. Router1(config-if)# ipv6 eigrp 10
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below. The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration ? 
Which of the following routing technique/techniques is/are used in distributed systems? (a) Fixed Routing (b) Virtual Routing (c) Dynamic Routing
Which is true regarding EIGRP successor routes?
1. A successor route is used by EIGRP to forward traffic to a destination.
2. Successor routes are saved in the topology table to be used if the primary route fails.
3. Successor routes are flagged as "active" in the routing table.
4. A successor route may be backed up by a feasible successor route.
5. Successor routes are stored in the neighbor table following the discovery process.
Two connected routers are configured with RIP routing. What will be the result when a router receives a routing update that contains a higher-cost path to a network already in its routing table?
Which two of the following are true regarding the distance-vector and link-state routing protocols?
1. Link state sends its complete routing table out all active interfaces on periodic time intervals.
2. Distance vector sends its complete routing table out all active interfaces on periodic time intervals.
3. Link state sends updates containing the state of its own links to all routers in the internetwork.
4. Distance vector sends updates containing the state of its own links to all routers in the internetwork.