Question 1: (4 Marks)
- Draw the following network using Precedence Diagram Method and determine the critical path(s); PDMin; Total Float for each activity considering the following data:
| Activity | Depends on | Duration (days) |
| A | — | 6 |
| B | — | 5 |
| C | — | 6 |
| D | A | 5 |
| E | A,B | 8 |
| F | B | 3 |
| G | E | 6 |
| H | G | 8 |
| I | F | 9 |
| J | C,E | 7 |
| K | J,H | 6 |
Question 2: (4 Marks)
- Draw the following network using Precedence Diagram Method and determine the PDMin; Total Float; and draw the Bar-chart considering the contract duration = 30 days with the following data:
| Activity | Depends on | Duration (days) |
| A | — | 3 |
| B | — | 4 |
| C | A | 3 |
| D | A | 4 |
| E | B | 8 |
| F | A, B | 3 |
| G | B | 6 |
| H | D, G | 7 |
| I | F | 2 |
| J | H, I | 10 |
Question 3: (4 Marks)
The following table illustrates the activities of a small project:
| Activity | Duration (Days) | Depends On |
| A | 10 | — |
| B | 3 | A & F |
| C | 7 | G |
| E | 5 | A & G |
| F | 11 | — |
| G | 10 | J |
| H | 9 | E & I & B |
| I | 4 | C |
| J | 6 | — |
| K | 5 | B |
It is required to:
- Draw Activity On Node “AON” Network;
- Calculate ES, EF, LS, LF for each activity;
- Highlight and Write the Critical Path;
- Find activity total float;
- Find activity free float.
Question 4: (4 Marks)
| Activity | Depend On | Duration |
| C | — | 6 |
| A | — | 7 |
| B | — | 8 |
| D | A & B | 9 |
| G | C | 6 |
| E | C | 5 |
| H | B & C | 7 |
| F | E & H | 10 |
Given a small project as shown in table:
It is required to:
- Draw (PDM) network;
- Calculate activity times;
- Find project duration;
- Locate critical path;
- Find total float of each activity;
- Find free float of each activity;
- Convert to (ADM) network.
Question 5: (4 Marks)
Given a list of activities for a small project as shown in the following table:
| Activity | Duration (days) | Early Start | Early Finish | Late Start | Late Finish | Total Float | Free Float |
| A | 0 | 5 | 0 | ||||
| B | 5 | 11 | 0 | ||||
| C | 11 | 13 | 6 | ||||
| D | 0 | 4 | 1 | ||||
| E | 4 | 7 | 4 | ||||
| F | 11 | 19 | 0 | ||||
| G | 19 | 20 | 0 |
It is required to:
- Complete the missing data in the table; and
- Draw The Activity-On-Node network, assuming that any relationship you need is FS=0.


0 comments