logo
optima learn

Network Flow Diagrams Questions for CAT

Preview 20 questions below, then sign up free to solve them in practice mode with worked solutions, and to reach all 493.

Verified questions493
Worked solutions in practice mode62 from CAT papers
137 easy141 medium215 hard

20 free Network Flow Diagrams questions

1EasyPassage, 4 questions

A supply network has one factory producing 1000 units feeding three distribution centres DC1, DC2 and DC3 with capacities 400, 350 and 500. Three retailers R1, R2, R3 have demands 300, 400 and 300. Slack is the excess of total capacity over total demand.

Question 1

What is the total capacity of the three distribution centres?

  1. A

    1300

  2. B

    1000

  3. C

    1250

  4. D

    1150

Question 2

What is the total demand of the three retailers?

  1. A

    1000

  2. B

    900

  3. C

    1100

  4. D

    1250

Question 3

What is the total slack (excess capacity) in the distribution centres?

  1. A

    150

  2. B

    350

  3. C

    0

  4. D

    250

Question 4

If DC2's capacity drops to 200, can all demands still be met?

  1. A

    Only if a retailer is dropped

  2. B

    Yes - total capacity 1100 still exceeds demand 1000

  3. C

    No - capacity falls below demand

  4. D

    No - it exactly ties at 1000

Show solution
2EasyPassage, 4 questions

A directed network has edge weights: A to B is 5, A to C is 12, C to D is 3, while B to C and the direct edge A to D are unknown. It is given that the shortest path from A to D via C is 15, and that the route A-B-C-D also equals this shortest distance.

Question 1

What is the total weight of the path A -> C -> D?

  1. A

    18

  2. B

    15

  3. C

    12

  4. D

    20

Question 2

What is the weight of edge B to C?

  1. A

    3

  2. B

    10

  3. C

    5

  4. D

    7

Question 3

For the 15-unit route via C to remain the shortest, what is the minimum the direct edge A to D can be?

  1. A

    10

  2. B

    18

  3. C

    15

  4. D

    12

Question 4

Using B to C = 7, what is the total weight of the path A -> B -> C -> D?

  1. A

    15

  2. B

    13

  3. C

    20

  4. D

    17

Show solution
3MediumPassage, 4 questions

Six junctions A, B, C, D, E, F are connected by two-way roads (km): A-B is 4, A-C is 6, B-C is 2, B-D is 5, C-D is 3, C-E is 8, D-E is 4, D-F is 7, E-F is 2. A simple path visits no junction twice; path length is the sum of edge distances.

Question 1

What is the shortest distance from A to F?

  1. A

    15

  2. B

    16

  3. C

    14

  4. D

    19

Question 2

What is the length of the LONGEST simple path from A to F?

  1. A

    22

  2. B

    25

  3. C

    20

  4. D

    19

Question 3

How many simple paths from A to F have total length strictly less than 18 km?

  1. A

    6

  2. B

    7

  3. C

    8

  4. D

    10

Question 4

What is the shortest distance from A to F if the route must pass through E?

  1. A

    16

  2. B

    19

  3. C

    22

  4. D

    15

Show solution
4MediumPassage, 4 questions

A company moves goods from A to D and must commit to ONE corridor for all its traffic (mutual exclusion): the X-corridor and the Y-corridor cannot both be used. Costs: A to X is 6, X to D is 9; A to Y is 8, Y to D is 4.

Question 1

What is the cost of the X-corridor route A -> X -> D?

  1. A

    12

  2. B

    13

  3. C

    16

  4. D

    15

Question 2

What is the cost of the Y-corridor route A -> Y -> D?

  1. A

    15

  2. B

    12

  3. C

    14

  4. D

    13

Question 3

Under mutual exclusion, which corridor should be chosen?

  1. A

    Both equally

  2. B

    Neither is usable

  3. C

    The Y-corridor

  4. D

    The X-corridor

Question 4

How much more expensive is the X-corridor than the Y-corridor?

  1. A

    3

  2. B

    2

  3. C

    0

  4. D

    5

Show solution
5HardPassage, 4 questions

Milind cycled from Mumbai to Pune and passed through seven villages on his way A, B, C, D, E, F and G not necessarily in the same order. Between any two villages, he cycled with a constant speed of s km/hr or 4s km/hr. Also, the distance between any two consecutive villages was the same.

Further following information is also known:

a) He stopped at one village between village E, and village F. Village B was not the first village Milind passed through.

b) The distance between villages D and A is same as the distance between villages A and C.

c) The time taken by Milind to reach village E from village D is two times the time taken by Milind to reach village A from village C.

d) Time spent by Milind at any of the seven villages is negligible. Village G came after village B.

Question 1

Which among the following was the first village which Milind passed through while cycling from Mumbai to Pune?

  1. A

    B

  2. B

    C

  3. C

    A

  4. D

    Cannot be determined

Question 2

Which among the following was the last, i.e., seventh village which Milind passed through while cycling from Mumbai to Pune?

  1. A

    G

  2. B

    F

  3. C

    E

  4. D

    Cannot be determined

Question 3

If the average speed of Milind between villages D and E and that between villages C and D is the same, which village comes immediately before village A?

  1. A

    F

  2. B

    C

  3. C

    B

  4. D

    G

Question 4

What is the maximum number of villages which can be between village B and village C?

  1. A

    0

  2. B

    1

  3. C

    2

  4. D

    3

Show solution
473 more waiting

Solve all 493 Network Flow Diagrams questions

You have previewed 20 above. Sign up free to solve those in practice mode with worked solutions, then keep going through the rest.

  • Full worked solutions
  • Per-question timer
  • Accuracy by topic
  • Progress tracking
See the 62 CAT PYQs on Network Flow DiagramsActual papers, 2017–2025, organised by year and slot

More DILR practice

818
Caselets
Data Interpretation
743
Games and Tournaments
Logical Reasoning
708
Data Tables
Data Interpretation
540
Distribution
Logical Reasoning
474
Quant-Based LR
Logical Reasoning
466
Selection
Logical Reasoning