Question: DATA FOR QUESTIONS : 4567 AND 9 A projet involves the setvide show below (activity dard devletlen elated with each evity, and date predecesser) for
DATA FOR QUESTIONS : 4567 AND 9 A projet involves the setvide show below (activity dard devletlen elated with each evity, and date predecesser) for each selvity areale show. The data are in meeles As we discussed in the dess, the environment of a project can be either deterlate or probabilistie. Ir la probabilitle then, ecording to convention, the analyst la regled to give three different state for completing each activity. The cases are wally demoted by: (most optimistlet), (most likely time, and best plastie time) The expected time for an activity is the meghted average of the three state. A weight of 1 le signed to "-", 4 to, and 1 to "V" and the expected time for each activity is then calculated by a + 4m + b a) Further, it is also possible to estimate a standard devletlen for each activity as follows: b- @) Please keep the above twe relationships in mind while swering all questions. ACTIVITY EXPECTED TIME STR. DEVIATION IMMEDECESSOS 10 B D 14 . F c 18 II. A DE C EG Q# 4. The number of paths involved in this network is: a) Just 4 b) Just5 c) Just 6 d) Just 7 D e) None of the above Q# 5. The maximum path lack in this network is: .) 12.eks b) 8 weeks c)10 weeks d) 9 weeks e) None of the above Q# 6. The length of the critical path in this network is 2) 24 weeks b) 35 weeks c) 32 weeks d) 30 weeks e) None of the above QU 7. For activity A, the value of 12; and "b" - 15. Thes, the most optimistic time." for activity A is: b) 5 weeks c) 9 weeks d) 7 weeks .) None of the above Thurit finish time for antity G DATA FOR QUESTIONS : 4567 AND 9 A projet involves the setvide show below (activity dard devletlen elated with each evity, and date predecesser) for each selvity areale show. The data are in meeles As we discussed in the dess, the environment of a project can be either deterlate or probabilistie. Ir la probabilitle then, ecording to convention, the analyst la regled to give three different state for completing each activity. The cases are wally demoted by: (most optimistlet), (most likely time, and best plastie time) The expected time for an activity is the meghted average of the three state. A weight of 1 le signed to "-", 4 to, and 1 to "V" and the expected time for each activity is then calculated by a + 4m + b a) Further, it is also possible to estimate a standard devletlen for each activity as follows: b- @) Please keep the above twe relationships in mind while swering all questions. ACTIVITY EXPECTED TIME STR. DEVIATION IMMEDECESSOS 10 B D 14 . F c 18 II. A DE C EG Q# 4. The number of paths involved in this network is: a) Just 4 b) Just5 c) Just 6 d) Just 7 D e) None of the above Q# 5. The maximum path lack in this network is: .) 12.eks b) 8 weeks c)10 weeks d) 9 weeks e) None of the above Q# 6. The length of the critical path in this network is 2) 24 weeks b) 35 weeks c) 32 weeks d) 30 weeks e) None of the above QU 7. For activity A, the value of 12; and "b" - 15. Thes, the most optimistic time." for activity A is: b) 5 weeks c) 9 weeks d) 7 weeks .) None of the above Thurit finish time for antity G