lOMoARcPSD|25260139
Questions
STD 2: Networks (Std 2), N3 Critical Path Analysis (Y12)
Flow Networks and Minimum Cuts 1. Networks, STD2 N3 2008 FUR1 1 MC
Critical Paths Steel water pipes connect ûve points underground.
Teacher: Edward Leaver The directed graph below shows the directions of the üow of water through these pipes between
these points.
Exam Equivalent Time: 36 minutes (based on HSC allocation of 1.5 minutes approx. per
mark)
STD2 Exam Contribution History
N3 Critical Path Analysis
i
MS-N3
Critical Path
Analysis
1% 2% 3% 4% 5% 6% 7%
*Analytics based on the average
Flow Networks and Minimum Paths contribution to the Std2 HSC
Critical Paths exams since 2019.
OVERVIEW
The directed graph shows that water can üow from
Networks is a new Std2 topic area and has been allocated between 9-13% of the Std2 exam over the
ûrst 3 years of the new syllabus.
We have split N3 Critical Path Analysis (6.3%) into two categories for the purposes of analysis: 1-
A. point 1 to point 2.
B. point 1 to point 4.
t
Critical Paths (4.3%) and 2-Flow Networks and Minimum Cuts (2.0%). C. point 4 to point 1.
This analysis will look at Flow Networks and Minimum Cuts (2.0%). D. point 4 to point 2.
ANALYSIS
Flow Networks and Minimum Cuts were not examined in 2021 but caused surprising problems in the
ûrst two years of the new Std2 syllabus exam.
Minimum Cut/Maximum Flow: this topic has been examined in both 2020 and 2019, in 3-mark
questions that were both poorly answered.
minimum art Max flow
"Reverse üows" (i.e. üows from sink to source across a minimum cut line) has proven a challenging
concept and deserves revision attention. We recommend a careful review of 2019 Std2 HSC 40.
Network adjustments to increase üow has appeared in both the 2019 Std2 exam and the NESA Topic
Guidance. We highly recommend reviewing examples of this question type which are easily identiûed
using the sub-category ûlter in the program.
In addition to more diýcult problems, we've designed our database to also cover many lower band
questions, in a similar style to the examples provided in oýcial Topic Guidance and exemplar
question releases from NESA.
notcounted Outs cut 2 1 5 3
s
Downloaded by alyssa koro (alyssakorotaeva@gmail.com) adf.gg H M
lOMoARcPSD|25260139
dependent on B
2. Networks, STD2 N3 2006 FUR1 5 MC
3. Networks, STD2 N3 SM-Bank 38 MC
For a particular project there are ten activities that must be completed.
Identify the critical path through this network.
These activities and their immediate predecessors are given in the following table.
hi A.
B.
C.
O
D.
A directed graph that could represent this project is
4. Networks, STD2 N3 2011 FUR1 8 MC
A. The diagram shows the tasks that must be completed in a project.
Also shown are the completion times, in minutes, for each task.
11 16 19
B.
1st
C.
mergeactivity
The critical path for this project includes activities
A.
B.
g
D.
ANY
C.
0
D.
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
5. Networks, STD2 N3 2019 FUR1 3 MC 6. Networks, STD2 N3 SM-Bank 42 MC
The üow of water through a series of pipes is shown in the network below The network diagram below üows from the source (S) to sink (T).
The numbers on the edges show the maximum üow through each pipe in litres per minute. Which of the edges is not at maximum capacity?
T
g hit I
0 A.
III um B.
The capacity of Cut , in litres per minute, is C.
A. 11 D.
B. 13
C. 14
D. 17
51 m
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
take longestpath
7. Networks, STD2 N3 SM-Bank 16 MC 8. Networks, STD2 N3 2019 FUR2-N 2
The network diagram represents a system of roads connecting a shopping centre to the motorway. The construction of the new reptile exhibit is a project involving nine activities, to .
Two routes from the shopping centre connect to A and one route connects to D to F. The directed network below shows these activities and their completion times in weeks.
The number on the edge of each road indicates the number of vehicles that can travel on it per hour.
3,3 16116
21,21 25
Fri mm
7,7 13113
Dili
755
a. Which activities have more than one immediate predecessor? (1 mark)
no unit
gACDFat
b. Write down the critical path for this project. (1 mark)
At present, the capacity of the network from the shopping centre to the motorway is not maximised.
Which additional road(s) would increase the network capacity to its maximum?
A. A road from A to F with a capacity of 20 vehicles per hour
y c. What is the latest start time, in weeks, for activity
9. Networks, STD2 N3 SM-Bank 31
? (1 mark)
B. A road from B to E with a capacity of 30 vehicles per hour Murray is building a new garage. The project involves activities to .
C. A road from C to F with a capacity of 30 vehicles per hour and a road from E to F with a
capacity of 60 vehicles per hour 814 1016 M we earliest
D. A road from B to F with a capacity of 30 vehicles per hour and a road from D to F with a
capacity of 30 vehicles per hour bee eater
p
agitated
1715
The network diagram shows these activities and their completion times in days.
a. Which TWO activities immediately precede activity ? (1 mark) cD
b. By completing the diagram shown, calculate the minimum time required to build the new garage. (2
ADEL ItW BA zo
marks)
U c. Hence, what is the üoat time for activity ? (1 mark)
14 8
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
10. Networks, STD2 N3 SM-Bank 34 11. Networks, STD2 N3 SM-Bank 33
The arrows on the diagram below show the direction of the üow of waste through a series of A project requires nine activities (A–I) to be completed. The duration, in hours, and the immediate
pipelines from a factory to a waste dump. predecessor(s) of each activity are shown in the table below.
The numbers along the edges show the number of megalitres of waste per week that can üow
through each section of pipeline.
o o
o
The minimum cut is shown as a dotted line. 215 12 7
Calculate the capacity of this cut, in megalitres of waste per week. (2 marks)
i. Sketch the network, identifying each activity and its duration. (2 marks)
ii. Identify the critical path and the minimum completion time of the project. (2 marks)
12. Networks, STD2 N3 FUR1 2020 6
The activity network below shows the sequence of activities required to complete a project.
The number next to each activity in the network is the time it takes to complete that activity, in days.
s
y
N
y Both
go.me
y 17
What is the critical path and minimum completion time for this project. (2 marks)
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
13. Networks, STD2 N3 SM-Bank 17 Worked Solutions
The network diagram represents a system of roads connecting a shopping centre to the motorway.
Two routes from the shopping centre connect to A and one route connects D to F. 1. Networks, STD2 N3 2008 FUR1 1 MC
The number on the edge of each road indicates the number of vehicles that can travel on it per hour.
2. Networks, STD2 N3 2006 FUR1 5 MC
Draw additional road(s) on the diagram to maximise the capacity. Include the number of vehicles
that can travel on each road. (2 marks)
3. Networks, STD2 N3 SM-Bank 38 MC
Copyright © 2004-21 The State of New South Wales (Board of Studies, Teaching and Educational Standards NSW)
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
4. Networks, STD2 N3 2011 FUR1 8 MC 7. Networks, STD2 N3 SM-Bank 16 MC
Motor
way
73
30
B F
97
E
55 25
90 50 20
30 110
Shopping A C D
Center 115 81
NOT TO
SCALE
80
39
5. Networks, STD2 N3 2019 FUR1 3 MC
8. Networks, STD2 N3 2019 FUR2-N 2
a.
b.
6. Networks, STD2 N3 SM-Bank 42 MC
c.
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
9. Networks, STD2 N3 SM-Bank 31 11. Networks, STD2 N3 SM-Bank 33
a. i.
b.
ii.
c.
12. Networks, STD2 N3 FUR1 2020 6
10. Networks, STD2 N3 SM-Bank 34
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
lOMoARcPSD|25260139
13. Networks, STD2 N3 SM-Bank 17
Motor
way
73
30
B F
97
E
55 25
90 50 20
30 110
Shopping A C D
Center 115 81
NOT TO
SCALE
80
39
Copyright © 2016-2022 M2 Mathematics Pty Ltd (SmarterMaths.com.au)
Downloaded by alyssa koro (alyssakorotaeva@gmail.com)
