Recent questions tagged routing / GATE Overflow for GATE CSE

2 votes

1 answer

61

Test by Bikram | Mock GATE | Test 3 | Question: 40
Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used. The following vectors have just come in to router $C$: from $B$: $\left ( 3, 0, 6, 5, 3, 8, 3 \right )$; from $D$: $\left ( 1,5, 3, 0, 8, 6, 3 \right )$ ... $\left (5, 4, 0, 3, 5, 6, 6\right )$ $\left (4, 2, 0, 2, 1, 5, 5\right )$

Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used.The following vectors have just come in to router $C$:from $B$: $\left ( 3...

Bikram

822 views

Bikram asked Feb 9, 2017

5 votes

1 answer

62

Packet Fragmentation on Routers [GateBook]

biranchi

788 views

biranchi asked Jan 24, 2017

2 votes

2 answers

63

MadeEasy CBT 2017:Computer Networks - Routing

Dulqar

740 views

Dulqar asked Jan 22, 2017

7 votes

2 answers

64

split horizon
Assume that network shown in below diagram uses distance vector routing with forwarding tables at each node. If each node periodically announces their vectors to the neighbour using the split-horizon strategy, what is the distance vector routing advertised from A to B after stabilization?

Assume that network shown in below diagram uses distance vector routing with forwarding tables at each node. If each node periodically announces their vectors to the neig...

dd

2.8k views

dd asked Jan 3, 2017

0 votes

1 answer

65

NW-Router-Packet Forwarding

KISHALAY DAS

355 views

KISHALAY DAS asked Dec 10, 2016

2 votes

2 answers

66

Test by Bikram | Computer Networks | Test 1 | Question: 20
Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay is $5$ microsec and propagation speed is $250,000$ km/sec the total transfer delay of $1$ kB packet from $A$ to $B$ is _______ microsec

Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay...

Bikram

1.1k views

Bikram asked Nov 26, 2016

2 votes

1 answer

67

UGC NET CSE | December 2011 | Part 2 | Question: 12
A station in a network in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ? Hot potato routing Flooding Static routing Delta routing

A station in a network in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ?Hot potato routingFloodin...

makhdoom ghaya

2.5k views

makhdoom ghaya asked Aug 13, 2016

4 votes

1 answer

68

UGC NET CSE | June 2014 | Part 3 | Question: 69
Which of the following is used in the options field of $IPv4$? Strict source routing Loose source routing Time stamp All of the above

Which of the following is used in the options field of $IPv4$? Strict source routingLoose source routingTime stampAll of the above

makhdoom ghaya

3.3k views

makhdoom ghaya asked Jul 12, 2016

3 votes

4 answers

69

UGC NET CSE | June 2012 | Part 2 | Question: 41
What is the routing algorithm used by RIP and IGRP? OSPF Link-state Dynamic Dijikstra vector

What is the routing algorithm used by RIP and IGRP?OSPFLink-stateDynamicDijikstra vector

go_editor

4.2k views

go_editor asked Jul 5, 2016

3 votes

3 answers

70

UGC NET CSE | June 2012 | Part 2 | Question: 17
In which routing method do all the routers have a common database? Distance vector Link state Link vector Dijikstra method

In which routing method do all the routers have a common database?Distance vectorLink stateLink vectorDijikstra method

go_editor

4.2k views

go_editor asked Jul 5, 2016

6 votes

4 answers

71

ISRO2016-68
Dynamic routing protocol enable routers to Dynamically discover and maintain routes Distribute routing updates to other routers Reach agreement with other routers about the network topology All of the above

Dynamic routing protocol enable routers toDynamically discover and maintain routesDistribute routing updates to other routersReach agreement with other routers about the ...

Desert_Warrior

4.3k views

Desert_Warrior asked Jul 3, 2016

4 votes

4 answers

72

ISRO2014-16
What is routing algorithm used by OSPF routing protocol? Distance vector Flooding Path vector Link state

What is routing algorithm used by OSPF routing protocol?Distance vectorFloodingPath vectorLink state

Anuanu

3.9k views

Anuanu asked Jun 24, 2016

2 votes

4 answers

73

Link state routing
Why TTL field is Used in link state packet in link state routing?? please explain

Why TTL field is Used in link state packet in link state routing??please explain

indrajeet

2.6k views

indrajeet asked Jun 15, 2016

11 votes

3 answers

74

ISRO2007-26
If there are five routers and six networks in intranet using link state routing, how many routing tables are there? $1$ $5$ $6$ $11$

If there are five routers and six networks in intranet using link state routing, how many routing tables are there?$1$$5$$6$$11$

go_editor

7.4k views

go_editor asked Jun 10, 2016

4 votes

2 answers

75

UGC NET CSE | December 2015 | Part 3 | Question: 12
Consider a subnet with $720$ routers. If a three level hierarchy is chosen with $8$ clusters, each containing $9$ regions of $10$ routers, then total number of entries in the routing table is _______ $25$ $27$ $53$ $72$

Consider a subnet with $720$ routers. If a three level hierarchy is chosen with $8$ clusters, each containing $9$ regions of $10$ routers, then total number of entries in...

Alok12

7.1k views

Alok12 asked Jun 5, 2016

1 votes

2 answers

76

ISI2014-PCB-CS-6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh. Find how many distinct shortest paths exist between two routers $R(i_1, j_1)$ ... how many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.

In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh.Find how many distin...

go_editor

745 views

go_editor asked May 31, 2016

40 votes

8 answers

77

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

57 votes

6 answers

78

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.7k views

go_editor asked Apr 21, 2016

0 votes

3 answers

79

Routing Table
We know routing table looks something like this . Network ID Subnet Mask Interface Question : We go with larger subnet mask in case of two matches. !! Why ? I know that's fact and called https://en.wikipedia.org/wiki/Longest_prefix_match !! What is ... some relation with the previous one. If i have to divide a network in 5 unequal subnets. then which is the correct method ?

We know routing table looks something like this . Network ID Subnet MaskInterface Question : We go with larger subnet mask in case of two matches. !! Why ? I know that's ...

Karan Patel 1

1.2k views

Karan Patel 1 asked Mar 20, 2016

2 votes

3 answers

80

if delays are recorded as 8 bit numbers
if delays are recorded as 8 bit numbers in a 50 router network and delay vectors are excahngesd twice a second how much bandwidth per(full duplex)line is chewed up by the distributed routing algorithm? assume that each router has three lines to other ... b)800 bps c)1200 bps d)None of these Answer is :- B can any one provide explanation about this answer?

if delays are recorded as 8 bit numbers in a 50 router network and delay vectors are excahngesd twice a second how much bandwidth per(full duplex)line is chewed up by the...

chitz

4.0k views

chitz asked Jan 17, 2016

0 votes

1 answer

81

Bandwidth
if delays are recorded as 8 Bit numbers in 50 router network and delay vector are exchanged twice a second how much bandwidth per full duplex line is chewed by distributed routing algorithm. Assume each router has 3 lines to other routers a)400 bps b)800 bps c)1200 now d) none

if delays are recorded as 8 Bit numbers in 50 router network and delay vector are exchanged twice a second how much bandwidth per full duplex line is chewed by distribute...

komal07

600 views

komal07 asked Jan 5, 2016

3 votes

2 answers

82

Steps taken by a Router on receiving a packet.
A Router outside the organization received a packet 224.240.7.91. Consider following steps that a router may take: 1. The router looks in its routing table to find out how to route the packet to the destination 2. The router looks at ... . So the router should take only step 1. Am I missing something? What should be the correct answer to this question?

A Router outside the organization received a packet 224.240.7.91. Consider following steps that a router may take: 1. The router looks in its routing table to find out ho...

अनुराग पाण्डेय

1.1k views

अनुराग पाण्डेय asked Dec 5, 2015

48 votes

7 answers

83

GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$

Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...

Ishrat Jahan

14.9k views

Ishrat Jahan asked Nov 3, 2014

23 votes

4 answers

84

GATE IT 2005 | Question: 85a
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, ...

Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...

Ishrat Jahan

5.3k views

Ishrat Jahan asked Nov 3, 2014

15 votes

3 answers

85

GATE IT 2005 | Question: 29
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control

Count to infinity is a problem associated with:link state routing protocol.distance vector routing protocolDNS while resolving host nameTCP for congestion control

Ishrat Jahan

6.0k views

Ishrat Jahan asked Nov 3, 2014

62 votes

8 answers

86

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

33 votes

4 answers

87

GATE IT 2008 | Question: 67
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 ( ... lesser number of network messages than LS S1, S2 and S4 only S1, S3 and S4 only S2 and S3 only S1 and S4 only

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...

Ishrat Jahan

9.6k views

Ishrat Jahan asked Oct 29, 2014

61 votes

7 answers

88

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.7k views

go_editor asked Sep 30, 2014

48 votes

4 answers

89

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.8k views

go_editor asked Sep 29, 2014

50 votes

6 answers

90

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.3k views

go_editor asked Sep 28, 2014

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

Materials: