Discussion
Home ‣ Verbal Reasoning ‣ Routes and Networks Comments
- Question
- What is the total number of ways to reach A to B in the network given?
Options- A. 12
- B. 16
- C. 20
- D. 22
- Correct Answer
- 16
ExplanationAs per the given above figure , we can see that
There are four ways to go from A to the first level of nodes. Each of these 4 nodes in turn leads into two more ways to go to the second level nodes.
Each of the second level nodes leads into two more ways to go to the third level nodes.
And from here we have only one way each to go to B.
Hence by fundamental principal of counting, total number of ways = 4 x 2 x 2 x 1 = 16 ways. - 1. The free capacity available at the Avanti-Vaishali pipeline is
Options- A. 0
- B. 100
- C. 200
- D. 300 Discuss
- 2. What is the free capacity available in the Avanti-Vidisha pipeline?
Options- A. 300
- B. 200
- C. 100
- D. 0 Discuss
- 3. The quantity moved from Avanti to Vidisha is
Options- A. 200
- B. 800
- C. 700
- D. 1,000 Discuss
- 4. A child must have had
Options- A. toys
- B. friends
- C. parents
- D. education Discuss
- 5. A window always has
Options- A. Curtain
- B. Panes
- C. Grill
- D. None of these Discuss
- 6. 4 cities are connected by a road network as shown in the figure. In how many ways can you start from any city and come back to it without travelling on the same road more than once?
Options- A. 8
- B. 12
- C. 16
- D. 20 Discuss
- 7. What is the maximum quantity of natural gas S can receive?
Options- A. 13 units
- B. 15 units
- C. 16 units
- D. 17 units Discuss
- 8. For which 2 cities it can be safely concluded that they have natural gas plants?
Options- A. M and P
- B. M and O
- C. P and N
- D. M and N Discuss
- 9. What is the maximum quantity of natural gas than can be transported from M to R?
Options- A. 11 units
- B. 7 units
- C. 9 units
- D. 6 units Discuss
- 10. Eight cities A, B, C, D, E, F, G and H are connected with one-way roads R 1, R 2, R 3, R 4, R 5 and R 6 in the following manner:
R1 leads from A to C via B;
R2 leads from C to D and then via B to F;
R3 leads from D to A and then via E to H;
R4 leads from F to B via G;
R5 leads from G to D; and R6 leads from F to H.
The minimum number of road segments that have to be blocked in order to make all traffic form B to D impossible is
Options- A. 5
- B. 4
- C. 3
- D. 2 Discuss
Routes and Networks problems
Search Results
Correct Answer: 300
Explanation:
From above given route diagram , we can see that
Free capacity at Avanti-Vaishali pipeline is 300, since capacity of each pipeline is 1000 and demand at Vidisha is 400 and 300 flows to Jyotishmati.
Thus, free capacity = {1000 ? (400 + 300)} = 300
Correct Answer: 0
Explanation:
On the basis of above given route network diagram , we can see that
Free capacity in Avanti-Vidisha is zero.
Explanation is similar as in previous answer.
Correct Answer: 1,000
Explanation:
As per the given above figure , we can see that
Since flow from Vaishali to Jyotishmati is 300 where as demand is 400 so the deficient 100 would be met by flow from Vidisha.
Again the demand of 700 in Panchal is again to be met by flow from Jyotishmati which can get it from Vidisha.
Thus, the quantity moved from Avanti to Vidisha is 200 + 100 + 700 = 1000
Correct Answer: parents
Explanation:
A child can be without Toys, Education and Friends but cannot be without parents. So child must have had a parents.
Correct Answer: None of these
Explanation:
.
Correct Answer: 12
Explanation:
According to question ,
It can be seen that every city is connected to all the other cities (i.e. 3 other cities).
Step 1: Let starting point is A, there are 3 ways in which we could proceed, viz. AB, AD or AC.
Step 2: Once we are at any of these cities (B, D or C), each one of them is connected to 3 other cities. But since we cannot go back to A the originating city, there are only 2 ways in which we could proceed from here.
Step 3: let us assume that we are at B, we can only go to D or C by taking BD or BC respectively. From this point we a choice of either directly going back to A (thus skipping 4th city or go to 4th city and come back to A. )
Step 4:- Now if we are at D, we can either take DA or DCA. So there are 2 more ways to go from here.
So , total number of ways = 3 x 2 x 2 = 12 ways.
Correct Answer: 17 units
Explanation:
From the above given figure ,
The maximum quantity of natural gas that S can receive = 6 + 2 + 9 = 17 units.
Therefore , required answer will be 17 units.
Correct Answer: M and P
Explanation:
We know that cities M and P are gas plants.Hence , option A will be correct answer .
Correct Answer: 6 units
Explanation:
From the above given figure and the conditions R can receive only 6 units (5 + 1) of natural gas if utilization is 100%.
Therefore , required answer will be 6 units.
Correct Answer: 2
Explanation:
On the basis of above given question , we can say that
We can block B to D if A to B means R1 and B to F means R2 is blocked.
Therefore minimum 2 ways needed to be block.
Comments
There are no comments.More in Verbal Reasoning:
Programming
Copyright ©CuriousTab. All rights reserved.