MCQ: Routes & Network - SSC CGL MCQ

The possible routes are as follows:

A - B  - C - D - E - F - A = 15 + 22 + 25 + 28 + 21 + 24 = 135 km.

Since there is only one route which covers all villages and pass through a village only once. 

Hence, 135 km is the correct answer.

The possible routes are as follows:

Here, four such routes are possible.

Hence, four is the correct answer.

The movement of symbols is as follows:

The symbol at position 1 will duplicate and move at position 9 and 6. The symbol at position 9 will duplicate and place at 4 and 3. The symbol at position 3 will move at position 5. The symbol at position 5 will move at position 7. The symbol at position 7 will move at position 1. The final figure will be as follows: 

1. B can directly go to A₁ and then A₂ or A₃

2. B can directly go to A₃ and then to A₅

3. B can go directly to A₂ and then to A₄

Now, taking options:-

a) B cannot supply manure to all of them without touching at least one person twice. → True →

To provide manure to A₄ and A₅ B have to touch A₂ and A₃. So, to provide manure to all of them B must touch A₂ and A₁ twice.

b) B must touch A_1­ to go to A₄ → False → B can directly go to A₂ and then A₄. It is not necessary for B to touch A₁.

c) B must touch A₁ to go to A₃ → False → B can directly go to A₃ also.

d) B must touch A₂ to go to A₅ → False → B must touch A₃ to go to A₅ not A₂.

Hence, statement “B cannot supply manure to A₄ of them without touching at-least one person twice” is True.

1. There are two one-way roads between P and Q.

2. There are three one-way roads between Q and R.

3. There is only one two-way road between R and T.

4. S and T are connected by two two-way roads.

5. S and U are connected by two one-way road.

If a person has to visit town S, starting from two Q. There are six possible ways.

Hence, the correct answer is 6.

In an office, two phones P₁ and P₂ are connected to LAN L₁ & L₂ respectively. If LAN is not in operation, the both the phones can be used for telecommunication.

→ L₁ can be used for computer C₁ and C₂ only

→ L₂ can be used for computer C₁ and C₃ only

If L₁ is not in operation, then P₁ (telecom) will work and C_1­ will work with network of L₂. So, only network of C₂ will not network.

Option(c) is answer.

For this question, we can take all points one by one.

Such route started from Point A: Yes it exists, route ACDEBDAB, etc.

Such route started from Point B: Yes it exist , route BADEBDCA, etc.

Such route started from Point C: No it does not exist.

Such route started from Point D: No it does not exist.

Such route started from Point E: No it does not exist.

So, such route is started only from two points i.e., A and B.

Hence, the correct answer is option(c)i.e. Two.

Option(a) is answer.

There are six possibilities to visit clients and return to pali.

(1) Pali - Neli - Seli - Teli - Pali

Distance = 31 Km + 26 Km + 18 Km + 20 Km = 95 Km

(2) Pali - Neli - Teli - Seli - Pali

Distance = 31 Km + 16 Km + 18 Km + 22 Km = 87 Km

(3) Pali - Teli - Neli - Seli - Pali

Distance = 20 Km + 16 Km + 26 Km + 22 Km = 84 Km

(4) Pali - Teli - Seli - Neli - Pali

Distance = 20 Km + 18 Km + 26 Km + 31 Km = 95 Km

(5) Pali - Seli - Neli - Teli - Pali

Distance = 22 Km + 26 Km + 16 Km + 20 Km = 84 Km

(6) Pali - Seli - Teli - Neli - Pali

Distance = 22 Km + 18 Km + 16 Km + 31 Km = 87 Km

So, the minimum distance to visit clients and return to pali is 84 Km.

Hence, the correct answer is option(a) i.e., 84 Km.

Alternate Method

Option(a) is answer.

For the minimum distance, we need to eliminate the path that has a maximum length.

Here we need to avoid the path of Neli to Pali i.e. 31 Km. So we have two options :

(1) Pali - Teli - Neli - Seli - Pali

Distance = 20 Km + 16 Km + 26 Km + 22 Km = 84 Km

(2) Pali - Seli - Neli - Teli - Pali

Distance = 22 Km + 26 Km + 16 Km + 20 Km = 84 Km

So, the minimum distance to visit clients and return to Pali is 84 Km.

Hence, the correct answer is option(a) i.e., 84 Km.

Option(1) is the answer.

Except for option(1), every map shows four 3-road junctions and two 2-road junctions while option(1) shows all junctions have 3-road junctions.

Hence the correct answer is an option(1) i.e., 

The possible routes are as follows:

T - P - R - Q - S - T = 22 + 15 + 26 + 19 + 20 = 102 km

T - P - Q - R - S - T = 22 + 24 + 26 + 17 + 20 =  109 km

T - S - Q - R - P - T = 20 + 19 + 26 +15 + 22 = 102 km

T - S - R - Q - P - T =  20 + 17 + 26 + 24 + 22 =  109 km

Hence, 109 km is the correct answer.