Advertisements
Advertisements
प्रश्न
Network problems have the advantage in terms of project
विकल्प
Scheduling
Planning
Controlling
All the above
Advertisements
उत्तर
All the above
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 |
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.
The following table gives the activities of a project and their duration in days
| Activity | 1 - 2 | 1 - 3 | 2 - 3 | 2 - 4 | 3 - 4 | 3 - 5 | 4 - 5 |
| Duration | 5 | 8 | 6 | 7 | 5 | 4 | 8 |
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.
The following table use the activities in a construction projects and relevant information
| Activity | 1 - 2 | 1 - 3 | 2 - 3 | 2 - 4 | 3 - 4 | 4 - 5 |
| Duration (in days) |
22 | 27 | 12 | 14 | 6 | 12 |
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.
The critical path of the following network is
One of the conditions for the activity (i, j) to lie on the critical path is
The objective of network analysis is to
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.
