CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Indian Hero - Birsa Munda

Consider the ...

Question

Consider the following routing table at an IP router:

Network No. Net Mask Next Hop

128.96.170.0 255.255.254.0 Interface 0

128.96.168.0 255.255.254.0 Interface 1

128.96.166.0 255.255.254.0 R2

128.96.164.0 255.255.252.0 R3

0.0.0.0 Default R4

For each IP address in Group-I identify the correct choice of the next hop form Group-II using the entries from the routing table above.
List -I

A. 128.96.171.92
B. 128.96.167.151
C. 128.96.163.121
D. 128.96.165.121

List -II
1. Interface 0
2. Interface 1
3. R2
4. R3
5. R4

A

A B C D

1 3 5 4

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

2 3 4 5

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

1 4 2 5

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

2 3 5 4

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A A B C D

1 3 5 4

IP Address Net Mask Network No. Next Hop

128.96.171.92 255.255.254.0 128.96.170.0 Interface

128.96.167.151 255.255.254.0 128.96.166.0 R2

128.96.163.151 default 0.0.0.0 R4

128.96.165.121 255.255.252.0 128.96.164.0 R3

Suggest Corrections

thumbs-up

1

Similar questions

Q. A router uses the following routing table:

Destination	Mask	Interface
144.16.0.0	255.255.0.0	eth0
144.16.64.0	255.255.224.0	eth1
144.16.68.0	255.255.255.0	eth2
144.16.68.64	255.255.255.224	eth3

A packet bearing a destination address 144.16.68.117 arrives at the router. On which interface will it be forwarded?

Q. 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 routing table is empty. The routing table is synchronously updated as follows. In each updating interval, three tasks are performed.
(i) A node determines whether its neighbors in the graph are accessible. If so, it sets the tentative cost to each accessible neighbor as 1. Otherwise, the cost is set to

\infty

(ii) From each accessible neighbor, it gets the costs to relay to other nodes via that neighbor (as the next hop).
(iii) Each node updates it routing table based on the information received in the previous two steps by choosing the minimum cost.

For the graph given above, possible routing tables for various nodes after they have stabilized, are shown in the following options. Identify the correct table.

Q. Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram.

All the router use the distance vector base routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link.
After all the routing tables stabilize, how many links in the network will never be used for carrying any data?

Q. A medium is divided into region I and II about x = 0 plane, as shown in the figure below. An electromagnetic wave with electric field

{\to E}_{1} = 4 {^a}_{x} +^3 a_{y} + 5 {^a}_{z}

is incident normally on the interface from region-I. The electric field

{\to E}_{2}

in region-II at the interface is

Q. Host X has IP address 192.168.1.97 and is connected through two routers R1 and R2 to another host Y with IP address 192.168.1.80. RouterR1 has IP addresses 192.168.1.135 and 192.168.1.110. R2 has IP addresses 192.168.1.67 and192.168.1.155.The network used in the network is 255.255.255.224.

Which IP address should X configure its gateway

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Indian Hero - Birsa Munda

HISTORY

Watch in App

explore_more_icon

Explore more

Indian Hero - Birsa Munda

Standard VIII History

Join BYJU'S Learning Program

CrossIcon