Question: ID (A) Description (Systems design) Predecessor (None) Time (2) ID (B) Description (subsystem A design) Predecessor (A) Time (1) ID (C) Description (subsystem B design)
ID (A) Description (Systems design) Predecessor (None) Time (2)
ID (B) Description (subsystem A design) Predecessor (A) Time (1)
ID (C) Description (subsystem B design) Predecessor (A) Time (1)
ID (D) Description (subsystem C design) Predecessor (A) Time (1)
ID (E) Description (Program A) Predecessor (B) Time (2)
ID (F) Description (Program B) Predecessor (C) Time (2)
ID (G) Description (Program C) Predecessor (D) Time (2)
ID (H) Description (subsystem A test) Predecessor (E) Time (1)
ID (I) Description (subsystem B test) Predecessor (F) Time (1)
ID (J) Description (subsystem C test) Predecessor (G) Time (1)
ID (K) Description (integration) Predecessor (H, I, J) Time (2)
ID (L) Description (integration test) Predecessor (K) Time (1)
using AON Diagrams answer the following questions
Calculate the early and late activity times
a) Calculate the critical paths and times in all cases
b) If it asks about slack times, just answer for individual activity slack times.
There is no need to distinguish between free and total slack.
Complete the forward and back pass. How sensitive is the network schedule?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
