Answer Posted / guest

Answer: D

Distance vector-based routing algorithms (also known as
Bellman-Ford

algorithms) pass periodic copies of a routing table from
router to

router. Regular updates between routers communicate topology
changes.

Each router receives a routing table from it's direct
neighbor and

increments all learned routes by one. By this method, each
router learns

the internetwork topology via second hand information.

Which multicast ip eigrp protocol use?

1160

---

How do you configure a Cisco router to route IPX?

1141

---

Explain what is the default behavior of access-list?

1007

---

What are the different layers of osi model?

1107

---

What is the maximum request timer?

1108

---

Briefly explain the conversion steps in data encapsulation.

1276

---

Does a bridge divide a network into smaller segments?

1381

---

What is the passive topology in ccna?

1237

---

How many hop counts are by default and how much you can increase in eigrp protocol?

1113

---

How does rip differs from igrp?

1121

---

What is the logical link control?

1151

---

Hub in star topology or bus topology?

1136

---

What is cam?

1198

---

Define ios?

1093

---

Referring to the commands shown, what command must next be used on the branch router prior to traffic being sent to the router router?

1220

---