# CRE 1 - Routes & Network | DI - Routes & Networks

**Answer the next 3 questions based on the information given below:**

The following diagram shows the pipelines carrying material from one location to another. Each location has a demand for material. The demand at Mathura is 800, at Faridabad is 800, at Delhi is 1,400, and at Gwalior is 400. Each arrow indicates the direction of material flow through the pipeline. The flow from Mathura to Faridabad is 600. The quantity of material flow is such that the demands at all these locations are exactly met. The capacity of each pipeline is 2,000.

**CRE 1 - Routes & Network | DI - Routes & Networks**

The quantity moved from Agra to Gwalior is

- (a)
400

- (b)
1600

- (c)
1400

- (d)
2000

Answer: Option D

**Explanation** :

Based on the data given:

Flow from Mathura to Faridabad is 600 whereas demand is 400, hence the deficient 2100 will have to come from Gwalior.

Similarly, the demand of 1,400 in Delhi is to be met by flow from Faridabad which can get it from Gwalior.

Thus, the quantity moved from Agra to Gwalior is 400 + 200 + 1,400 = 2,000

Hence, option (d).

Workspace:

**CRE 1 - Routes & Network | DI - Routes & Networks**

What is the free capacity available in the Agra-Gwalior pipeline?

- (a)
600

- (b)
400

- (c)
200

- (d)
0

Answer: Option D

**Explanation** :

Consider the solution to first question of this set.

Free capacity in Agra-Gwalior is zero.

Hence, option (d).

Workspace:

**CRE 1 - Routes & Network | DI - Routes & Networks**

The free capacity available at the Agra-Mathura pipeline is

- (a)
0

- (b)
400

- (c)
200

- (d)
600

Answer: Option D

**Explanation** :

Consider the solution to first question of this set.

Thus, free capacity for Agra-Mathura pipeline = 2000 – (800 + 600) = 600

Hence, option (d).

Workspace:

**Answer the next 2 questions based on the information given below:**

Natural gas once extracted from a source is purified for commercial use at natural gas plants. From gas plants it is pumped to various destinations through pipelines. There are pumping stations, at intermediate places to maintain recommended pressure in the pipelines. The pumping stations do not produce or process any natural gas. They pump out exactly the quantity they receive from plants or other pumping stations.

The following figure depicts a network gas pipelines. The circles denote the locations of gas plants, pumping stations or cities with big demand for natural gas. One location can be only one of these three. The numbers on the arrows are the capacities (in appropriate units) of the pipeline that carry gas in the direction of the arrow. Currently the demand supply situation is such that the capacity utilization of the pipelines is very close to 100%.

**CRE 1 - Routes & Network | DI - Routes & Networks**

For which two 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: Option A

**Explanation** :

Here we need to see the net output for each of these plants i.e., if Total output – Input is positive, it will be a plant.

For M: 5 + 4 + 2 = 11, i.e., M is a gas plant

For N: 6 – 4 – 3 = -1

For O: 5 – 5 – 2 = -2

For P: 3 + 1 + 2 + 1 + 2 – 2 = 7, i.e., P is a gas plant

For Q: 9 – 6 – 1 = 2, i.e., Q is a gas plant

For R: 6 – 5 – 1 = 0

Hence, option (a).

Workspace:

**CRE 1 - Routes & Network | DI - Routes & Networks**

What is the maximum quantity of natural gas that can be transported from M to R?

- (a)
11 units

- (b)
7 units

- (c)
9 untis

- (d)
6 units

Answer: Option D

**Explanation** :

Since amount received at R is same as amount supplied, R is a pumping station.

Now, R has to supply 6 units to S.

Maximum amount R can receive is 6 units.

∴ Maximum quantity of natural gas that can be transported from M to R = 6 units.

Hence, option (d).

Workspace:

**CRE 1 - Routes & Network | DI - Routes & Networks**

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:

- R
_{1}leads from A to C via B; - R
_{2}leads from C to D and then via B to F; - R
_{3}leads from D to A and then via E to H; - R
_{4}leads from F to B via G; - R
_{5}leads from G to D; and - R
_{6}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

- (a)
5

- (b)
4

- (c)
3

- (d)
2

- (e)
1

Answer: Option D

**Explanation** :

Ways of going from B → D

1. B → C → D

2. B → F → G → D

If we block R_{1} and R_{2}, we will not be able to go from B → D.

Hence, we need to block 2 roads.

Hence, option (d).

Workspace:

## Feedback

Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.