SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Networks, STD2 N3 2025 HSC 22

A network of pipes with one cut is shown. The number on each edge gives the capacity of that pipe in L/min.
 

  1. What is the capacity of the cut shown?   (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

  2. The diagram shows a possible flow for this network of pipes.
     

    1. What is the value of \(x\)? Give a reason for your answer.   (2 marks)

      --- 4 WORK AREA LINES (style=lined) ---

    2. Which of the pipes in the flow are at full capacity?   (1 mark)

      --- 2 WORK AREA LINES (style=lined) ---

    3. The maximum flow for this network is 50 L/min.
    4. Which path of pipes could have an increase in flow of 2 L/min to achieve the maximum flow?   (1 mark)

      --- 2 WORK AREA LINES (style=lined) ---

Show Answers Only

a.    \(\text{Capacity} =62\)

b.i.   \(x=30\) 

b.ii. \(DE, DG, CF \ \text{and} \ FG\)

b.iii.  \(ACEG\)

Show Worked Solution

a.    \(\text{Capacity} =26+24+12=62\)
 

b.i.   \(\text{Inflow into} \ C\) \(=\text{Outflow from} \ C\)
  \(x\) \(=5+13+12\)
    \(=30\)

 

b.ii. \(DE, DG, CF \ \text{and} \ FG\)
 

b.iii.  \(ACEG\)

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 4, Band 5, smc-915-20-Cut Capacity, smc-915-30-Flow Capacity

Networks, STD2 N3 2024 GEN2 14

A manufacturer \((M)\) makes deliveries to the supermarket \((S)\) via a number of storage warehouses, \(L, N, O, P, Q\) and \(R\). These eight locations are represented as vertices in the network below.

The numbers on the edges represent the maximum number of deliveries that can be made between these locations each day.
 

  1. When considering the possible flow of deliveries through this network, many different cuts can be made.   
  2. Determine the capacity of Cut 1, shown above.   (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

  3. Determine the maximum number of deliveries that can be made each day from the manufacturer to the supermarket.   (2 marks)

    --- 3 WORK AREA LINES (style=lined) ---

    

Show Answers Only

a.    \(46\)

b.    \(37\)

Show Worked Solution

a.    \(13+18+6+9=46\)

\(\text{(Reverse flow}\ Q → O\ \text{is not counted.)}\)
 

b.  

\(\text{Max deliveries (min cut)}\ =13+5+11+8=37\)

♦ Mean mark (b) 29%.

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 3, Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity

Networks, STD2 N3 2023 HSC 14 MC

A network with source `A` and sink `B` is shown. The capacities of two paths are labelled. The cut shown on the diagram has a capacity of 30 .
 

Which of the following statements is correct?

  1. The maximum flow is 30.
  2. The maximum flow is 35.
  3. The maximum flow is 30 or less.
  4. The maximum flow is 30 or more.
Show Answers Only

`C`

Show Worked Solution

`text{The cut shows a maximum flow of 30, however there is no information}`

`text{that it is the minimum cut across the network}`

`text{(i.e. it is possible the minimum cut is lower than 30).}`

`=>C`

♦♦ Mean mark 33%.

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 5, smc-915-20-Cut Capacity

Networks, STD2 N3 2022 HSC 31

A wildlife park has 5 main attractions `(A, B, C, D, E)` connected by directional paths. A simple network is drawn to represent the flow through the park's paths. The number of visitors who can access each path at any one time is also shown.
 

   

  1. What is the flow capacity of the cut shown?  (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

  2. By showing a suitable cut on the diagram below, explain why the network's current maximum flow capacity is less than 40 visitors.  (2 marks)
     

    --- 2 WORK AREA LINES (style=lined) ---

  3. One path is to be increased in capacity so that the overall maximum flow will be 40 visitors at any one time.
  4. Which path could be increased and by how much?  (2 marks)

    --- 4 WORK AREA LINES (style=lined) ---

Show Answers Only
  1. `40`
  2.  
     
  3. `text{Max flow = min cut = 35}`
  4. `AE\ text{or}\ DE\ text{could be increased by 5}`
Show Worked Solution

a.   `text{Flow capacity = 10 + 20 + 10 = 40}`

`text{(DE is not counted as it runs from sink → source)}`
 

b.  
       

`text{Min Cut = Max Flow}`

`text{Max Flow}` `=15+10+10`  
  `=35<40`  


♦ Mean mark part (a) 45%.
♦♦ Mean mark part (b) 33%.

 

c.   `text{Two strategies:}`

  • `AE\ text{could be increased by 5}`
  • `DE\ text{could be increased by 5}`

`text{(both strategies would increase the minimum cut to}`

  `text{40 by increasing the flow to vertex}\ E\ text{to 30)}`


Mean mark 52%.

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 4, Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity, smc-915-50-Network Adjustments

Networks, STD2 N3 FUR2 4

Training program 1 has the cricket team starting from exercise station `S` and running to exercise station `O`.

For safety reasons, the cricket coach has placed a restriction on the maximum number of people who can use the tracks in the fitness park.

The directed graph below shows the capacity of the tracks, in number of people per minute.
 


 

  1. Determine the capacity of Cut 1, shown above.  (1 mark)

    --- 1 WORK AREA LINES (style=lined) ---

  2. What is the maximum flow from `S` to `O`, in number of people per minute?  (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

Show Answers Only
  1. `52`
  2. `50`
Show Worked Solution
a.   `text{Capacity (Cut 1)}` `= 20 + 12 + 20`
    `= 52`

 

b.   `text(Max flow/minimum cut)`

♦♦ Mean mark part (c) 32%.

`= 20 + 10 + 20`

`= 50`
 

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 4, Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity

Networks, STD2 N3 2019 FUR1 3 MC

The flow of water through a series of pipes is shown in the network below

The numbers on the edges show the maximum flow through each pipe in litres per minute.
 

 
The capacity of Cut `Q`, in litres per minute, is

  1. 11
  2. 13
  3. 14
  4. 17
Show Answers Only

`C`

Show Worked Solution

`text(Capacity of cut)\ Q`

`= 5 + 6 + 3`

`= 14`

`=>  C`

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 4, smc-915-20-Cut Capacity

Networks, STD2 N3 2019 HSC 40

A museum is planning an exhibition using five rooms.

The museum manager draws a network to help plan the exhibition. The vertices `A`, `B`, `C`, `D` and `E` represent the five rooms. The number on the edges represent the maximum number of people per hour who can pass through the security checkpoints between the rooms.
 


 

  1. What is the capacity of the cut shown?  (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

  2. The museum manager is planning for a maximum of 240 visitors to pass through the exhibition each hour. By using the 'minimum cut-maximum flow' theorem, the manager determines that the plan does not provide sufficient flow capacity.

     

    Draw the minimum cut onto the network below and recommend a change that the manager could make to one or more security checkpoints to increase the flow capacity to 240 visitors per hour.   (2 marks)
     
       

    --- 2 WORK AREA LINES (style=lined) ---

Show Answers Only
  1. `290`
  2.   

Show Worked Solution
a.    `text(Capacity)` `= 130 + 90 + 70`
    `= 290`

♦♦ Mean mark 32%.
COMMENT: In part (a), edge BC flows from the exit to the entry and is therefore not counted.

b.   `text(Maximum flow capacity:)`

 

`text(Minimum cut = 80 + 40 + 65 + 45 = 230)`

♦♦♦ Mean mark 19%.
COMMENT: In part (b), edge BC now flows from entry to exit in the new “minimum” cut and is counted.

`text(If security is improved to increase the flow)`

`text(between Room C and Room B by 10 visitors)`

`text(per hour, the network’s flow capacity increases)`

`text(to 240.)`

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 5, Band 6, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity, smc-915-50-Network Adjustments

Networks, STD2 N3 SM-Bank 45

An oil pipeline network is drawn below that shows the flow capacity of oil pipelines in kilolitres per hour.
 


 

A cut is shown.

  1. What is the capacity of the cut.  (1 mark)

    --- 1 WORK AREA LINES (style=lined) ---

  2. Calculate the minimum cut of this network?  (2 marks)

    --- 3 WORK AREA LINES (style=lined) ---

  3. Copy the network diagram, showing the maximum flow capacity of the network by labelling the flow of each edge.  (2 marks)

    --- 8 WORK AREA LINES (style=lined) ---

Show Answers Only
  1. `35`
  2. `text(See Worked Solutions)`
  3.  
Show Worked Solution
i.    `text(Capacity of cut)` `= 7 + 15 + 13`
    `= 35\ text(kL/h)`

 

ii. 

♦♦ COMMENT: Be very careful! RS is not included as it goes from sink to source.
 


  

`text(Minimum cut)` `= 7 + 14 + 9`
  `= 30\ text(kL/h)`

 

iii.   

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 3, Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity, smc-915-30-Flow Capacity

Networks, STD2 N3 2018 FUR2 1

The graph below shows the possible number of postal deliveries each day between the Central Mail Depot and the Zenith Post Office.

The unmarked vertices represent other depots in the region.

The weighting of each edge represents the maximum number of deliveries that can be made each day.
 


 

  1.  Cut A, shown on the graph, has a capacity of 10.

     

     Two other cuts are labelled as Cut B and Cut C.

    1.  Write down the capacity of Cut B.  (1 mark)

      --- 1 WORK AREA LINES (style=lined) ---

    2.  Write down the capacity of Cut C. (1 mark)

      --- 1 WORK AREA LINES (style=lined) ---

  2.  Determine the maximum number of deliveries that can be made each day from the Central Mail  Depot to the Zenith Post Office.  (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

Show Answers Only
    1. `9`
    2. `13`
  1.  `7`
Show Worked Solution
a.i.    `text{Capacity (Cut B)}` `= 3 + 2 + 4`
    `= 9`

 

a.ii.    `text{Capacity (Cut C)}` `= 3 + 6 + 4`
    `= 13`

♦ Mean mark part (b) 32%.
COMMENT: Review carefully! Most common incorrect answer was 9.

 

b.  `text(Minimum cut) = 2 + 2 + 3 = 7`

`:.\ text(Maximum deliveries) = 7`

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 3, Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity

Networks, STD2 N3 2008 FUR1 6 MC

networks-fur1-2008-vcaa-6-mc

 
For the graph above, the capacity of the cut shown is

A.   `36`

B.   `30`

C.   `42`

D.   `46`

Show Answers Only

`=> C`

Show Worked Solution

`text(Ignoring any flows that cross the cut from the)`

♦♦ Mean mark 35%.
MARKER’S COMMENT: For an individual flow to contribute to the “cut”, it must flow from the source to the sink.

`text(sink side to the source side.)`
 

`text(Capacity of the cut)`

`= 4 + 2 + 7 + 9 + 8 + 6 + 6`

`= 42`

`=> C`

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 5, smc-915-20-Cut Capacity

Networks, STD2 N3 SM-Bank 36

In the network below, the values on the edges give the maximum flow possible between each pair of vertices. The arrows show the direction of flow. A cut that separates the source from the sink in the network is also shown.
 

vcaa-networks-fur1-2010-6-7

 

  1. Calculate the capacity of the cut shown in the diagram.  (1 mark)

    --- 1 WORK AREA LINES (style=lined) ---

  2. Calculate the maximum flow between source and sink.  (2 marks)

    --- 4 WORK AREA LINES (style=lined) ---

Show Answers Only
  1. `23`
  2. `10`
Show Worked Solution

i.   `text(Capacity of the cut)`

♦ Mean mark part (a) 50%.
COMMENT: A quarter of students incorrectly included the “8” which is flowing in the opposite direction.

`= 11 + 5 + 7`

`= 23`

 

ii.

vcaa-networks-fur1-2010-6-7i

`text(The maximum flow)`

♦♦ Mean mark part (b) 24%.

`=\ text{minimum cut (see above)}`

`= 4 + 2 + 3 + 1`

`= 10`

Filed Under: Flow Networks and Minimum Cuts Tagged With: Band 5, smc-915-10-Min Cut/Max Flow, smc-915-20-Cut Capacity

Copyright © 2014–2025 SmarterEd.com.au · Log in