Advertisements
Advertisements
प्रश्न
Construct the network for each the projects consisting of various activities and their precedence relationships are as given below:
| Activity | A | B | C | D | E | F | G | H | I | J | K |
| Immediate Predecessors | - | - | - | A | B | B | C | D | E | H, I | F, G |
Advertisements
उत्तर
APPEARS IN
संबंधित प्रश्न
Draw the event oriented network for the following data:
| Events | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| Immediate Predecessors | - | 1 | 1 | 2, 3 | 3 | 4, 5 | 5, 6 |
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
Construct the network for the project whose activities are given below.
| Activity | 0 - 1 | 1 - 2 | 1 - 3 | 2 - 4 | 2 - 5 | 3 - 4 | 3 - 6 | 4 - 7 | 5 - 7 | 6 - 7 |
| Duration (in week) | 3 | 8 | 12 | 6 | 3 | 3 | 8 | 5 | 3 | 8 |
Calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity. Determine the critical path and the project completion time.
A project schedule has the following characteristics
| Activity | 1 - 2 | 1 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 9 | 5 - 6 | 5 - 7 | 6 - 8 | 7 - 8 | 8 - 10 | 9 - 10 |
| Time | 4 | 1 | 1 | 1 | 6 | 5 | 4 | 8 | 1 | 2 | 5 | 7 |
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.
One of the conditions for the activity (i, j) to lie on the critical path is
In a network while numbering the events which one of the following statements is false?
The objective of network analysis is to
In critical path analysis, the word CPM mean
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 |
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.
