smc-916-10-Table to Network

Networks, STD2 N3 SM-Bank 44

A project involves nine activities, `A` to `I`.

The immediate predecessor(s) of each activity is shown in the table below.

	Activity	Immediate predecessor(s)
	`A`	`-`
	`B`	`A`
	`C`	`A`
	`D`	`B`
	`E`	`B, C`
	`F`	`D`
	`G`	`D`
	`H`	`E, F`
	`I`	`G, H`

A directed network for this project will require a dummy activity.

Sketch the network diagram, clearly identifying the dummy activity. (3 marks)

Show Answers Only

`B`

Show Worked Solution

`text(Sketch network diagram:)`

`text(The dummy activity needs to be drawn)`

`text(from the end of activity)\ B\ text(to the start)`

`text(of activity)\ E.`

Networks, STD2 N3 2019 HSC 26

A project requires activities `A` to `F` to be completed. The activity chart shows the immediate prerequisite(s) and duration for each activity.

By drawing a network diagram, determine the minimum time for the project to be completed. (3 marks)

--- 8 WORK AREA LINES (style=lined) ---
Determine the float time of the non-critical activity. (1 mark)

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

Show Answers Only

`text(15 hours)`
`text(3 hours)`

Show Worked Solution

`text(Scanning forwards:)`

`text(Minimum time = 2 + 6 + 2 + 4 + 1 = 15 hours)`

`text{(Scanning forwards and backwards is highly recommended but not}`

`text{required in the network diagram.)}`

b. `text(Critical Path is)\ ABDEF.`

♦♦ Mean mark 30%.

`text(Non-critical activity is)\ C.`

`text(Float time)`	`= 5 – 2`
	`= 3\ text(hours)`

Networks, STD2 N3 SM-Bank 33

A project requires nine activities (A–I) to be completed. The duration, in hours, and the immediate predecessor(s) of each activity are shown in the table below.

Sketch the network, identifying each activity and its duration. (2 marks)

--- 7 WORK AREA LINES (style=lined) ---
Identify the critical path and the minimum completion time of the project. (2 marks)

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

Show Answers Only

`text(Critical path is)\ ACFGI.`
`text(20 hours)`

Show Worked Solution

i. `text(Sketch the network:)`

ii. `text(Completion time of possible paths:)`

`ABEGI = 4 + 3 + 5 + 4 + 3 = 19\ text(hours)`

`ACFGI = 4 + 7 + 2 + 4 + 3 = 20\ text(hours)`

`ADHI = 4 + 2 + 5 + 3 = 14\ text(hours)`

`:.\ text(Critical path is)\ ACFGI.`

`:.\ text{Minimum completion time = 20 hours}`

Networks, STD2 N3 SM-Bank 49

A project requires nine activities (A–I) to be completed. The duration, in hours, and the immediate predecessor(s) of each activity are shown in the table below.

Sketch the network diagram. (3 marks)

--- 8 WORK AREA LINES (style=lined) ---
Find the minimum completion time for this project, in hours. (1 mark)

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

Show Answers Only

20 `text(hours)`

Show Worked Solution

i. `text(Sketch the network:)`

ii. `text(Completion time of paths:)`

`ABEGI = 4 + 3 + 5 + 4 + 3 = 19\ text(hours)`

`ACFGI = 4 + 7 + 2 + 4 + 3 = 20\ text(hours)`

`ADHI = 4 + 2 + 5 + 3 = 14\ text(hours)`

`:.\ text{Minimum completion time (critical path) = 20 hours}`

Networks, STD2 N3 EQ-Bank 19

An engineering project requires activities A to G to be completed, as shown in the table.

The minimum completion time for the project is 25 days and the critical path includes activities B, D, E and F. The float for activity G is two days and the float for activity C is four days.

Find the possible duration for each of the activities A, C, F and G. Include a network diagram in your answer. (5 marks)

Show Answers Only

`text(Duration of)\ F = 1\ text(day)`

`text(Duration of)\ G = 4\ text(days)`

`text(*Understand why there are many possibilities for the duration of)`

`A and C, text(provided they add up to 20 days and)\ A\ text(is not longer)`

`text{than 7 days (or a new critical path is created)}.`

Show Worked Solution

`text(Sketch the network:)`

`text{Critical path information included in the network (where EST = LST)}`

`F\ text(is on critical path ⇒ no float)`

`:.\ text(Duration of)\ F= 25 – 24 = 1\ text(day)`

`text(Duration of)\ G`	`=\ text(LST of next activity − EST of)\ G – text(float)`
	`= 25 – 19 – 2`
	`= 4\ text(days)`

`text(The float of)\ C\ text{is 4 days (given)}`

`:.\ text(Duration of)\ C`	`=\ text(LST of)\ F -\ text(EST of)\ C – 4`
	`= 24 -\ text(EST of)\ C – 4`
	`= 20 -\ text(EST of)\ C`

`text(EST of)\ C =\ text(Duration of)\ A\ \ (A\ text(has no prerequisites))`

`=>\ text(Duration of)\ A +\ text(Duration of)\ C = 20\ text(days)`

`:.\ text(Possible durations of)\ A\ text(and)\ C\ text(are:)`

`A = 5\ text(days), C = 15\ text(days)`

`text(*Understand why there are many possibilities for the duration of)`

`A and C, text(provided they add up to 20 days and)\ A\ text(is not longer)`

`text{than 7 days (or a new critical path is created)}.`

Networks, STD2 N3 EQ-Bank 18

An engineering project requires activities A to G to be completed, as shown in the table.

The minimum completion time for the project is 40 weeks and the critical path includes activities A, C, E and G. The float for activity F is six weeks and the float for activity D is 9 weeks.

Find the possible duration for each of the activities B, D, F and G. Include a network diagram in your answer. (5 marks)

Show Answers Only

`text(Duration of)\ G = 3\ text(weeks)`

`text(Duration of)\ F = 9\ text(weeks)`

`text(There are many possibilities for the duration of)\ B and D`

`text(provided they add up to 28 weeks and)\ B\ text(is not longer)`

`text{than 10 weeks (new critical path)}.`

Show Worked Solution

`text(Sketch network:)`

`text{Critical path added to network (where EST = LST)}`

`G\ text(is on critical path ⇒ no float)`

`:.\ text(Duration of)\ G = 40-37 = 3\ text(weeks)`

`text(Duration of)\ F`	`=\ text(40 − EST of)\ F – text(float)`
	`= 40 – 25 – 6`
	`= 9\ text(weeks)`

`text(Float of)\ D = 9\ text{weeks (given)}`

`:.\ text(Duration of)\ D`	`=\ text(LST of)\ G -\ text(EST of)\ D – 9`
	`= 37 -\ text(EST of)\ D – 9`
	`= 28 -\ text(EST of)\ D`

`text(EST of)\ D =\ text(Duration of)\ B\ \ \ (B\ text(has no prerequisites))`

`text(Duration of)\ B +\ text(Duration of)\ D = 28\ text(weeks)`

`:.\ text(Possible durations of)\ B\ text(and)\ D\ text(are:)`

`B = 1\ text(week), D = 27\ text(weeks)`

`text(*Understand why there are many possibilities for the duration of)`

`B and D, text(provided they add up to 28 weeks and)\ B\ text(is not longer)`

`text{than 10 weeks (or a new critical path is created)}.`

Networks, STD2 N3 2006 FUR2 3

The five musicians are to record an album. This will involve nine activities.

The activities and their immediate predecessors are shown in the following table.

The duration of each activity is not yet known.

Use the information in the table above to complete the network below by including activities `G`, `H` and `I`. (2 marks)

There is only one critical path for this project.

How many non-critical activities are there? (1 mark)

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

The following table gives the earliest start times (EST) and latest start times (LST) for three of the activities only. All times are in hours.

Write down the critical path for this project. (1 mark)

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

The minimum time required for this project to be completed is 19 hours.

What is the duration of activity `I`? (1 mark)

The duration of activity `C` is 3 hours.

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

Determine the maximum combined duration of activities `F` and `H`. (1 mark)
--- 1 WORK AREA LINES (style=lined) ---

Show Answers Only

`5`
`B E G I`
`text(7 hours)`
`text(8 hours)`

Show Worked Solution

b. `text(S)text(ince no time information, possible critical paths are:)`

`ADGI, BEGI\ text(or)\ CFHI\ \ text{(all have 4 activities)}`

`:.\ text(Non-critical activities)`

`= 9 – 4 = 5`

c. `text(Critical activities have zero float time.)`

♦ Mean mark of parts (c)-(e) (combined) was 36%.

`=> A\ text(and)\ C\ text(are non-critical.)`

`:. B E G I\ text(is the critical path.)`

d.	`text(Duration of)\ \ I`	`= 19 – 12`
		`= 7\ text(hours)`

e. `text(Maximum time for)\ F\ text(and)\ H`

♦♦ MARKER’S COMMENT: Many students incorrectly answered 9 hours in part (e).

`=\ text(LST of)\ I – text(duration)\ C – text(slack time of)\ C`

`= 12 – 3 – 1`

`= 8\ text(hours)`

A project will be undertaken in the wildlife park. This project involves the 13 activities shown in the table below. The duration, in hours, and predecessor(s) of each activity are also included in the table.

Activity `G` is missing from the network diagram for this project, which is shown below.

Complete the network diagram above by inserting activity `G`. (1 mark)
Determine the earliest starting time of activity `H`. (1 mark)

--- 1 WORK AREA LINES (style=lined) ---
Given that activity `G` is not on the critical path
1. write down the activities that are on the critical path in the order that they are completed (1 mark)
  
  --- 2 WORK AREA LINES (style=lined) ---
2. find the latest starting time for activity `D`. (1 mark)
  
  --- 1 WORK AREA LINES (style=lined) ---
Consider the following statement.

‘If the time to complete just one of the activities in this project is reduced by one hour, then the minimum time to complete the entire project will be reduced by one hour.’

Explain the circumstances under which this statement will be true for this project. (1 mark)

--- 2 WORK AREA LINES (style=lined) ---
Assume activity `F` is reduced by two hours.
What will be the minimum completion time for the project? (1 mark)

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

Show Answers Only

b. `7\ text(hours)`

c.i. `AFIM`

c.ii. `14\ text(hours)`

d. `text(The statement will only be true if the crashed activity)`
`text(is on the critical path)\ \ A F I M.`

e. `text(36 hours)`

Show Worked Solution

b. `text(Scanning forwards and backwards:)`

`text(EST for Activity)\ H`

`= 4 + 3`

`= 7\ text(hours)`

c.i. `A F I M`

♦♦ Mean mark of parts (c)-(e) (combined) was 40%.

c.ii. `text(LST of)\ G = 20 – 4 = 16\ text(hours)`

`text(LST of)\ D = 16 – 2 = 14\ text(hours)`

d. `text(The statement will only be true if the time reduced activity)`

MARKER’S COMMENT: Most students struggled with part (d).

`text(is on the critical path)\ \ A F I M.`

e. `A F I M\ text(is 37 hours.)`

`text(If)\ F\ text(is reduced by 2 hours, the new critical)`

`text(path is)\ \ C E H G I M\ text{(36 hours)}`

`:.\ text(Minimum completion time = 36 hours)`

Networks, STD2 N3 2011 FUR1 7 MC

Andy, Brian and Caleb must complete three activities in total (K, L and M)

The table shows the person selected to complete each activity, the time it will take to complete the activity in minutes and the immediate predecessor for each activity.

All three activities must be completed in a total of 40 minutes.

The instant that Andy starts his activity, Caleb gets a telephone call.

The maximum time, in minutes, that Caleb can speak on the telephone before he must start his allocated activity is

A. `5`

B. `13`

C. `18`

D. `24`

Show Answers Only

`D`

Show Worked Solution

`text(Maximum speaking time on phone)`

♦♦ Mean mark 33%.
MARKER’S COMMENT: Many students incorrectly answered the earliest starting time, C.

`= 40 – text(duration of)\ M`

`= 40 – 16`

`= 24\ text(minutes)`

`=> D`

Networks, STD2 N3 2015 FUR1 9 MC

The table below shows, in minutes, the duration, the earliest starting time (EST) and the latest starting time (LST) of eight activities needed to complete a project.