Paper Tayyari

Lecture 17: Routing Algorithms

MCQs, short and long questions from lecture 17.Lecture 17 ki MCQs, short aur long sawal.

5 MCQs · 5 short · 3 long questions · 5 MCQs from past papers5 MCQs · 5 short · 3 long sawal · 5 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/5
– correctsahi
1.
★ Midterm Spring 2010

_______ computes shortest paths in a graph by using weights on edges as a measure of distance.

  1. AGreedy algorithm
  2. BDistance vector algorithm
  3. CDijkstra's algorithm
  4. DNon of the given

Dijkstra's algorithm finds least-weight paths using edge weights as distances.

2.
★ VU quiz

Which of the following statement is true regarding Distance-vector routing?

  1. AIt is very simple to implement.
  2. BPacket switch updates its own routing table first.
  3. CIt is used in RIP.
  4. DAll of the above

Distance-vector routing is simple, each switch updates its own table first, and RIP uses it.

3.
★ VU quiz

Which of the following statement is true regarding Link-state routing?

  1. ANetwork topology is separated from route computation.
  2. BEach switch builds its own routing tables.
  3. CLink-state routing uses Djikstra’s algorithm.
  4. DAll of the above

In link-state routing each switch learns topology and computes its own table with Dijkstra's algorithm.

4.
★ VU quiz

Which one of the following is the responsibility of Djikstra’ algorithm?

  1. ATo compute the shortest path between two nodes
  2. BTo extract next hop information from path information
  3. CTo insert next hop information into routing table
  4. DAll of the above

The procedure computes shortest paths, extracts next hops and inserts them into routing tables.

5.
★ VU quiz

Djikstra’s algorithm is used to compute the……………….

  1. Ashortest path between two nodes
  2. Bnumber of nodes used in the network
  3. Cdistance between different nodes
  4. Dnone of the above

Dijkstra's algorithm computes shortest paths in a weighted graph.