Advertisements
Advertisements
Question
Draw a network diagram for the following activities.
Activity code | A | B | C | D | E | F | G | H | I | J | K |
Predecessor activity | - | A | A | A | B | C | C | C, D | E, F | G, H | I, J |
Solution
APPEARS IN
RELATED QUESTIONS
Draw the network for the project whose activities with their relationships are given below:
Activities A, D, E can start simultaneously; B, C > A; G, F > D, C; H > E, F.
Construct the network for the projects consisting of various activities and their precedence relationships are as given below:
A, B, C can start simultaneously A < F, E; B < D, C; E, D < G
Draw the network and calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and determine the Critical path of the project and duration to complete the project.
Jobs | 1 - 2 | 1 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 5 | 4 - 6 | 5 - 6 |
Duration | 6 | 5 | 10 | 3 | 4 | 6 | 2 | 9 |
A Project has the following time schedule
Activity | 1 - 2 | 1 - 6 | 2 - 3 | 2 - 4 | 3 - 5 | 4 - 5 | 6 - 7 | 5 - 8 | 7 - 8 |
Duration (in days) | 7 | 6 | 14 | 5 | 11 | 7 | 11 | 4 | 18 |
Construct the network and calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and determine the Critical path of the project and duration to complete the project.
In constructing the network which one of the following statements is false?
In a network while numbering the events which one of the following statements is false?
Which of the following is not correct?
In critical path analysis, the word CPM mean
Draw the network diagram for the following activities.
Activity code | A | B | C | D | E | F | G |
Predecessor activity | - | - | A | A | B | C | D, E |
A Project has the following time schedule
Activity | 1 - 2 | 2 - 3 | 2 - 4 | 3 - 5 | 4 - 6 | 5 - 6 |
Duration (in days) |
6 | 8 | 4 | 9 | 2 | 7 |
Draw the network for the project, calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and find the critical path. Compute the project duration.