Register

GATE IT 2008 | Question: 67

16,335 views
50 50 votes

Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?

(S1):  Count to infinity is a problem only with DV and not LS routing
(S2):  In LS, the shortest path algorithm is run only at one node
(S3):  In DV, the shortest path algorithm is run only at one node
(S4):  DV requires lesser number of network messages than LS

  1. S1, S2 and S4 only
  2. S1, S3 and S4 only
  3. S2 and S3 only
  4. S1 and S4 only

7 Answers

Page:
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE IT 2008 | Quest...Next → · GATE IT 2008 | Quest...
← Previous in category · GATE IT 2008 | Quest...Next in category → · GATE IT 2008 | Quest...
Position:
Show:

Related questions

100 100 votes
7 answers 7 answers
30.9k
30.9k views
Ishrat Jahan asked Oct 29, 2014
30,934 views
GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ ad...
76 76 votes
10 answers 10 answers
22.7k
22.7k views
Ishrat Jahan asked Oct 29, 2014
22,663 views
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresse...
22 22 votes
4 answers 4 answers
14.5k
14.5k views
Ishrat Jahan asked Oct 29, 2014
14,500 views
GATE IT 2008 | Question: 70
The total number of keys required for a set of $n$ individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are:$...
73 73 votes
7 answers 7 answers
24.5k
24.5k views
Ishrat Jahan asked Oct 29, 2014
24,527 views
GATE IT 2008 | Question: 69
The three way handshake for $\text{TCP}$ connection establishment is shown below. Which of the following statements are TRUE?$S1:$ Loss of $\text{SYN} + \text{ACK}$ from...