

MCQOPTIONS
Saved Bookmarks
This section includes 64 Mcqs, each offering curated multiple-choice questions to sharpen your Verbal Reasoning knowledge and support exam preparation. Choose a topic below to get started.
1. |
Neelam rides her bicycle from her house at A to her office at B, taking the shortest path. Then the number of possible shortest paths that she can choose is |
A. | 60 |
B. | 75 |
C. | 45 |
D. | 90 |
E. | 72 |
Answer» E. 72 | |
2. |
Neelam rides her bicycle from her house at A to her club at C, via B taking the shortest path. Then the number of possible shortest paths that she can choose is |
A. | 1170 |
B. | 630 |
C. | 792 |
D. | 1200 |
E. | 936 |
Answer» B. 630 | |
3. |
Which of the following is true? |
A. | Statement 1 is true but statement 2 is false. |
B. | Statement 1 is false but statement 2 is true. |
C. | Statement 1 is true and so is statement 2. |
D. | Statements 1 and 2 are false. |
Answer» D. Statements 1 and 2 are false. | |
4. |
Which nodes should be selected for installation of surveillance cameras? |
A. | 3, 6 and 7 |
B. | 3, 1 and 4 |
C. | 2, 5 ,1 and 4 |
D. | None of these |
Answer» D. None of these | |
5. |
What is the number of routes from P to Q? |
A. | 5 |
B. | 6 |
C. | 9 |
D. | 12 |
Answer» C. 9 | |
6. |
For a route that satisfies the above restrictions, which of the following statements is true? |
A. | There is no route that satisfies the above restriction. |
B. | A route can either start at C or end at C, but not both. |
C. | D can be only an intermediate city in the route. |
D. | The route has to necessarily end at E. |
Answer» C. D can be only an intermediate city in the route. | |
7. |
How many different starting cities are possible such that the above restriction is satisfied? |
A. | One |
B. | Zero |
C. | Three |
D. | Two |
Answer» E. | |
8. |
What is the distance between A and B? |
A. | 5 km |
B. | 6 km |
C. | 7 km |
D. | 8 km |
Answer» E. | |
9. |
What is the length of route - 2 ? |
A. | 11 km |
B. | 12 km |
C. | 13 km |
D. | Insufficient information |
Answer» B. 12 km | |
10. |
Find the maximum distance between A and H if condition is that traveling a city more than once is not allowed. |
A. | 3800 |
B. | 3700 |
C. | 3200 |
D. | None of these |
Answer» C. 3200 | |
11. |
Find the ratio of maximum to minimum distance between A and H if condition is that traveling a city more than once is not allowed. |
A. | 37 : 14 |
B. | 37 : 23 |
C. | 39 : 14 |
D. | None of these |
Answer» B. 37 : 23 | |
12. |
If a new path is constructed from T7 to Y then find the total number of paths from X to Y? |
A. | 7 |
B. | 6 |
C. | 8 |
D. | None of these |
Answer» B. 6 | |
13. |
Which one of the following could be the value of toll taxes at T1, T2, T3 ............... T8 such that total cost of travel is same irrespective of route? |
A. | 50, 10, 0, 10, 60, 20, 0, 10 |
B. | 50, 20, 0, 10, 60, 20, 0, 10 |
C. | 50, 20, 0, 10, 40, 20, 0, 10 |
D. | None of these |
Answer» C. 50, 20, 0, 10, 40, 20, 0, 10 | |
14. |
What is the difference between maximum amount and minimum amount that Mr. Ricky can spend on a day if he wants to travel from his home (X) to office (Y) if toll tax at each toll booth is Rs 50? |
A. | 180 |
B. | 210 |
C. | 240 |
D. | None of these |
Answer» B. 210 | |
15. |
If toll tax is devised in such a way that total cost of travel remains same irrespective of the path then what is the minimum cost of travel from X to Y? |
A. | 240 |
B. | 260 |
C. | 310 |
D. | None of these |
Answer» C. 310 | |
16. |
If toll tax at all of the toll booths is same and is devised such that the ratio of maximum cost to minimum cost of travel from X to Y is 28 : 19 then which one of the following is the cost of travel from X to Y through toll Both T3? |
A. | 320 or 510 |
B. | 330 or 560 |
C. | 560 or 510 |
D. | None of these |
Answer» D. None of these | |
17. |
Find the minimum distance between H to A without visiting city E. |
A. | 1200 |
B. | 1300 |
C. | 1400 |
D. | None of these |
Answer» D. None of these | |
18. |
What is the minimum distance between H to A through D? |
A. | 1800 |
B. | 2000 |
C. | 2200 |
D. | None of these |
Answer» E. | |
19. |
If path H E C is taken and no city is visited twice then find the total number of such paths. |
A. | 3 |
B. | 4 |
C. | 5 |
D. | None of these |
Answer» C. 5 | |
20. |
The quantity moved from Avanti to Vidisha is |
A. | 200 |
B. | 800 |
C. | 700 |
D. | 1,000 |
Answer» E. | |
21. |
What is the free capacity available in the Avanti-Vidisha pipeline? |
A. | 300 |
B. | 200 |
C. | 100 |
D. | 0 |
Answer» E. | |
22. |
The free capacity available at the Avanti-Vaishali pipeline is |
A. | 0 |
B. | 100 |
C. | 200 |
D. | 300 |
Answer» E. | |
23. |
What is the total number of ways to reach A to B in the network given? |
A. | 12 |
B. | 16 |
C. | 20 |
D. | 22 |
Answer» C. 20 | |
24. |
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? |
A. | 8 |
B. | 12 |
C. | 16 |
D. | 20 |
Answer» C. 16 | |
25. |
If the government wants to ensure that all motorists travelling from S to T pay the same amount ( fuel costs and toll combined ) regardless of the route they choose and the street from B to C is under repairs ( and hence unusable ), then a feasible set of toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is : |
A. | 2, 5, 3, 2 |
B. | 0, 5, 3, 1 |
C. | 1, 5, 3, 2 |
D. | 2, 3, 5, 1 |
E. | B and C both |
Answer» F. | |
26. |
If the government wants to ensure that all routes from S to T get the same amount of traffic, then a feasible set of toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is : |
A. | 0, 5, 2, 2 |
B. | 0, 5, 4, 1 |
C. | 1, 5, 3, 3 |
D. | 1, 5, 3, 2 |
E. | 1, 5, 4, 2 |
Answer» E. 1, 5, 4, 2 | |
27. |
The government wants to devise a toll policy such that the total cost to the commuters per trip is minimized. The policy should also ensure that not more than 70 percent of the total traffic passes through junction B. The cost incurred by the commuter travelling from point S to point T under this policy will be: |
A. | $ 7 |
B. | $ 9 |
C. | $ 10 |
D. | $ 13 |
E. | $ 14 |
Answer» D. $ 13 | |
28. |
If the government wants to ensure that the traffic at S gets evenly distributed along streets from S to A, from S to B, and from S to D, then a feasible set of toll charged (in rupees) at junctions A, B, C, and D respectively to achieve this goal is: |
A. | 0, 5, 4, 1 |
B. | 0, 5, 2, 2 |
C. | 1, 5, 3, 3 |
D. | 1, 5, 3, 2 |
E. | 0, 4, 3, 2 |
Answer» B. 0, 5, 2, 2 | |
29. |
If the government wants to ensure that no traffic flows on the street from D to T, while equal amount of traffic flows through junctions A and C, then a feasible set of toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is |
A. | 1, 5, 3, 3 |
B. | 1, 4, 4, 3 |
C. | 1, 5, 4, 2 |
D. | 0, 5, 2, 3 |
E. | 0, 5, 2, 2 |
Answer» F. | |
30. |
What is the maximum quantity of natural gas S can receive? |
A. | 13 units |
B. | 15 units |
C. | 16 units |
D. | 17 units |
Answer» E. | |
31. |
For which 2 cities it can be safely concluded that they have natural gas plants? |
A. | M and P |
B. | M and O |
C. | P and N |
D. | M and N |
Answer» B. M and O | |
32. |
What is the maximum quantity of natural gas than can be transported from M to R? |
A. | 11 units |
B. | 7 units |
C. | 9 units |
D. | 6 units |
Answer» E. | |
33. |
Eight cities A, B, C, D, E, F, G and H are connected with one-way roads R1, R2, R3, R4, R5 and R6 in the following manner:
|
A. | 5 |
B. | 4 |
C. | 3 |
D. | 2 |
E. | 1 |
Answer» E. 1 | |
34. |
In the adjoining figure, the lines represent one-way roads allowing travel only northwards or only westwards. Along how many distinct routes can a car reach point B from point A? |
A. | 15 |
B. | 56 |
C. | 120 |
D. | 336 |
Answer» C. 120 | |
35. |
If a new path is constructed from |
A. | 7 |
B. | 6 |
C. | 8 |
D. | None of these |
Answer» B. 6 | |
36. |
Which one of the following could be the value of toll taxes at |
A. | 50, 10, 0, 10, 60, 20, 0, 10 |
B. | 50, 20, 0, 10, 60, 20, 0, 10 |
C. | 50, 20, 0, 10, 40, 20, 0, 10 |
D. | None of these |
Answer» C. 50, 20, 0, 10, 40, 20, 0, 10 | |
37. |
What is the distance between |
A. | 5 km |
B. | 6 km |
C. | 7 km |
D. | 8 km |
Answer» E. | |
38. |
What is the length of |
A. | 11 km |
B. | 12 km |
C. | 13 km |
D. | Insufficient information |
Answer» B. 12 km | |
39. |
What is the number of routes from |
A. | 5 |
B. | 6 |
C. | 9 |
D. | 12 |
Answer» C. 9 | |
40. |
For a route that satisfies the above |
A. | There is no route that satisfies the above restriction. |
B. | A route can either start at C or end at C, but not both. |
C. | D can be only an intermediate city in the route. |
D. | The route has to necessarily end at E. |
Answer» C. D can be only an intermediate city in the route. | |
41. |
If toll tax at all of the toll booths is same and is devised such that the ratio of maximum cost to minimum cost of travel from |
A. | 320 or 510 |
B. | 330 or 560 |
C. | 560 or 510 |
D. | None of these |
Answer» D. None of these | |
42. |
What is the minimum distance between |
A. | 1800 |
B. | 2000 |
C. | 2200 |
D. | None of these |
Answer» E. | |
43. |
Find the maximum distance between |
A. | 3800 |
B. | 3700 |
C. | 3200 |
D. | None of these |
Answer» C. 3200 | |
44. |
Neelam rides her bicycle from her house at |
A. | 60 |
B. | 75 |
C. | 45 |
D. | 90 |
E. | 72 |
Answer» E. 72 | |
45. |
Which nodes should be selected for installation of surveillance |
A. | 3, 6 and 7 |
B. | 3, 1 and 4 |
C. | 2, 5 ,1 and 4 |
D. | None of these |
Answer» D. None of these | |
46. |
If path |
A. | 3 |
B. | 4 |
C. | 5 |
D. | None of these |
Answer» C. 5 | |
47. |
If toll tax is devised in such a way that total cost of travel remains same irrespective of the path then what is the minimum cost of travel from |
A. | 240 |
B. | 260 |
C. | 310 |
D. | None of these |
Answer» C. 310 | |
48. |
Find the total number of paths from city H to city A if condition is that traveling a city more than once is not allowed. |
A. | 44 |
B. | 55 |
C. | 59 |
D. | None of these |
Answer» C. 59 | |
49. |
Find the ratio of maximum to minimum distance between |
A. | 37 : 14 |
B. | 37 : 23 |
C. | 39 : 14 |
D. | None of these |
Answer» B. 37 : 23 | |
50. |
Find the minimum distance between |
A. | 1200 |
B. | 1300 |
C. | 1400 |
D. | None of these |
Answer» D. None of these | |