Search results for routing / GATE Overflow for GATE CSE

61 votes

7 answers

1

GATE CSE 2010 | Question: 54
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$

Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram.All the routers use the distance ...

go_editor

23.8k views

go_editor asked Sep 30, 2014

57 votes

6 answers

2

GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$

Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...

go_editor

23.8k views

go_editor asked Apr 21, 2016

48 votes

4 answers

3

GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$

Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...

go_editor

23.9k views

go_editor asked Sep 29, 2014

5 votes

3 answers

4

GATE CSE 2023 | Question: 15
Which of the following statements is/are $\text{INCORRECT}$ about the $\textsf{OSPF (Open Shortest Path First)}$ routing protocol used in the Internet? $\textsf{OSPF}$ implements Bellman-Ford algorithm to find shortest paths. $\textsf{OSPF}$ ... path routing. $\textsf{OSPF}$ is used as an inter-domain routing protocol. $\textsf{OSPF}$ implements hierarchical routing.

Which of the following statements is/are $\text{INCORRECT}$ about the $\textsf{OSPF (Open Shortest Path First)}$ routing protocol used in the Internet?$\textsf{OSPF}$ imp...

admin

8.3k views

admin asked Feb 15, 2023

9 votes

4 answers

5

GATE CSE 2020 | Question: 15
Consider the following statements about the functionality of an $\textsf{IP}$ based router. A router does not modify the $\textsf{IP}$ ... packet. Which of the above statements is/are TRUE? I and II only I only II and III only II only

Consider the following statements about the functionality of an $\textsf{IP}$ based router.A router does not modify the $\textsf{IP}$ packets during forwarding.It is not ...

Arjun

10.6k views

Arjun asked Feb 12, 2020

22 votes

2 answers

6

GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.

Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity.The routers exchange distance vector routing informatio...

Arjun

9.8k views

Arjun asked Feb 15, 2022

62 votes

8 answers

7

GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$

A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...

Ishrat Jahan

19.0k views

Ishrat Jahan asked Oct 30, 2014

4 votes

1 answer

8

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 22
An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $128.96.39.10.$ ... will be forwarded is __________. $\text{R}2$ $\text{R}3$ $\text{R}4$ $\text{R}6$

An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $128.96.39.10.$The router's routing table has the following entries:$$\begi...

GO Classes

403 views

GO Classes asked Jan 28

50 votes

6 answers

9

GATE CSE 2014 Set 3 | Question: 26
An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $131.23.151.76$ ... The identifier of the output interface on which this packet will be forwarded is ______.

An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $131.23.151.76$. The router's routing table has the following entries:$$\be...

go_editor

17.4k views

go_editor asked Sep 28, 2014

0 votes

0 answers

10

How is the next-hop IP information passed down from Network layer to DLL
Let's say my device wants to send a packet to far way device many networks away. Once my router receives the packet, it doesn't know much about this destination IP and chooses to send it to the next hop router. ... layer and change the port number can they also interfere in the DLL and do all operations by itself in reality?

Let’s say my device wants to send a packet to far way device many networks away. Once my router receives the packet, it doesn’t know much about this destination IP an...

phaniphani

119 views

phaniphani asked Jan 6

2 votes

0 answers

11

madeeasy ots
In first option one bit error to merge two consecutive frames into one – I cannot understand this. B should be 2^k/2-1 for selective reject. It should be false . Right??

In first option one bit error to merge two consecutive frames into one – I cannot understand this. B should be 2^k/2-1 for selective reject. It should be false . Right...

Sajal Mallick

222 views

Sajal Mallick asked Dec 2, 2023

21 votes

5 answers

12

GATE CSE 2014 Set 2 | Question: 23
Which of the following is TRUE about the interior gateway routing protocols $-$ Routing Information Protocol $(RIP)$ and Open Shortest Path First $(OSPF)$ RIP uses distance vector routing and OSPF uses link state routing OSPF uses distance vector ... RIP uses link state routing Both RIP and OSPF use link state routing Both RIP and OSPF use distance vector routing

Which of the following is TRUE about the interior gateway routing protocols $-$ Routing Information Protocol $(RIP)$ and Open Shortest Path First $(OSPF)$RIP uses distanc...

go_editor

9.2k views

go_editor asked Sep 28, 2014

40 votes

8 answers

13

GATE CSE 2010 | Question: 55
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. Suppose the weights of all unused links are changed to $2$ and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused? $0$ $1$ $2$ $3$

Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram.Suppose the weights of all unused links are changed...

go_editor

13.1k views

go_editor asked Apr 21, 2016

0 votes

0 answers

14

10. Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9

Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...

ahmed65956

632 views

ahmed65956 asked Sep 27, 2023

2 votes

1 answer

15

GO Classes 2023 | IIITH Mock Test 1 | Question: 22
Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$ If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$ $x>4$ $y+x<6$ $y+x<4$ $x<4$

Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$If the network follows link state routing algorithm to determine next hop for least cost ...

GO Classes

748 views

GO Classes asked Mar 26, 2023

1 votes

1 answer

16

GO Classes 2023 | IIITH Mock Test 1 | Question: 20
The routing table below uses the longest prefix match in its routing decisions. ...

The routing table below uses the longest prefix match in its routing decisions.$$\begin{array}{|c|c|}\hline \text{Network Address/Length} & \text{Next Hop} \\\hline \hlin...

GO Classes

632 views

GO Classes asked Mar 26, 2023

1 votes

0 answers

17

GATE CSE 2023 | Memory Based Question: 47
Which of the following is incorrect in the case of OSPF protocol? OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routing OSPF uses the Bellman-Ford algorithm to determine the shortest path. OSPF uses an inter-domain routing protocol OSPF employs hierarchical routing

Which of the following is incorrect in the case of OSPF protocol?OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routingOSPF use...

GO Classes

1.4k views

GO Classes asked Feb 5, 2023

1 votes

1 answer

18

distance routing algorithm
statement : distance routing algorithm is adaptive algorithm which consider the load on the network whether the given statement is true or not ?

statement : distance routing algorithm is adaptive algorithm which consider the load on the networkwhether the given statement is true or not ?

Gurdeep Saini

859 views

Gurdeep Saini asked Nov 9, 2018

0 votes

1 answer

19

Test series
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain ... in this case should i consider both of then or just one of them that is having less number of hops in between?

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram.All the routers use the distance vector based routing alg...

MonuKhan

1.1k views

MonuKhan asked Jan 19, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true