The documents describe several projects with activities and their predecessors. Critical paths and floats are calculated for each:
1) A network diagram is drawn showing activities A through K with durations and predecessors. The critical path and project duration are found. Total, free, and independent floats are calculated for each activity.
2) Another project's network is shown with activities A through J and predecessors. The critical path is determined.
3) A third project is presented with activities A through I, predecessors, and durations. The critical path is derived. Total floats are found for the project.
4) A fourth network of activities A through N is shown with predecessors and times. The critical path is identified for this project
The documents describe several projects with activities and their predecessors. Critical paths and floats are calculated for each:
1) A network diagram is drawn showing activities A through K with durations and predecessors. The critical path and project duration are found. Total, free, and independent floats are calculated for each activity.
2) Another project's network is shown with activities A through J and predecessors. The critical path is determined.
3) A third project is presented with activities A through I, predecessors, and durations. The critical path is derived. Total floats are found for the project.
4) A fourth network of activities A through N is shown with predecessors and times. The critical path is identified for this project
The documents describe several projects with activities and their predecessors. Critical paths and floats are calculated for each:
1) A network diagram is drawn showing activities A through K with durations and predecessors. The critical path and project duration are found. Total, free, and independent floats are calculated for each activity.
2) Another project's network is shown with activities A through J and predecessors. The critical path is determined.
3) A third project is presented with activities A through I, predecessors, and durations. The critical path is derived. Total floats are found for the project.
4) A fourth network of activities A through N is shown with predecessors and times. The critical path is identified for this project
The documents describe several projects with activities and their predecessors. Critical paths and floats are calculated for each:
1) A network diagram is drawn showing activities A through K with durations and predecessors. The critical path and project duration are found. Total, free, and independent floats are calculated for each activity.
2) Another project's network is shown with activities A through J and predecessors. The critical path is determined.
3) A third project is presented with activities A through I, predecessors, and durations. The critical path is derived. Total floats are found for the project.
4) A fourth network of activities A through N is shown with predecessors and times. The critical path is identified for this project
Activity A B C D E F G H I J K L M Procedure - - B C A,D D A,D E G,H I G J,K L Duration 6 5 2 2 2 1 6 5 6 2 4 3 1 (a) Draw a network diagram for this project. (b) Find the critical path and duration of the project. (c) Find the total, free and independent floats of various activities.
2) Find Critical path and floats of the project.
Activity A B C D E F G H I J K Predecessors - A B C B E D,F E H G,I J Time 13 8 10 9 11 10 8 6 7 14 18
3) Consider following project and derive critical path for it, also find total floats of project. Activity A B C D E F G H I Predecessor - - A,B A,B B D,E C,F D,E G,H Duration 15 10 10 10 5 5 20 10 15
4) Find critical path of network.
Activity A B C D E F G H I J K L M N Predecessor - - - A,B B,C A,B C D,E,F D G G H,J K I,L Time 8 5 3 12 5 6 9 4 5 7 7 10 9 3
5) Draw Critical path for following network.
Activity A B C D E F G H I J Predecessor - - A A B,C B,C E E D,G F,H,I Time 15 15 3 5 8 12 1 14 3 14
6) Derive critical path.
Activity A B C D E F G H I J K L Predecessor- - - B,C A C E E D,F,H E I,J G Time 9 4 7 8 7 5 10 8 6 9 10 2 Draw the networks and determine the critical path.
1) Activity Predecessors Optimistic time Pessimistic Most likely time A - 2 4 3 B - 8 8 8 C A 7 11 9 D B 6 6 6 E C 9 11 10 F C 10 18 14 G C,D 11 11 11 H F,G 6 14 10 I E 4 6 5 J I 3 5 4 K H 1 1 1
2) Activity Predecessors Optimistic time Pessimistic Most likely time A - 4 16 7 B - 1 15 5 C A 6 30 12 D A 2 8 5 E C 5 17 11 F D 3 15 6 G B 3 27 9 H E,F 1 7 4 I G 4 28 19 3) Activity Predecessors Optimistic time Pessimistic Most likely time A - 3 5 4 B - 4 10 8 C B 5 8 6 D A,C 9 10 15 E B 4 8 6 F D,E 3 5 4 G D,E 5 8 6 H D,E 1 4 3 I G 2 5 4 J F,I 7 10 8 K G 4 6 5 L H 8 13 9 M J,K,L 6 8 7 4) Activity Predecessors Optimistic time Pessimistic Most likely time A - 4 10 4 B - 1 9 2 C - 2 14 5 D A 1 7 4 E A 1 3 2 F A 1 9 5 G B,C 1 9 2 H C 4 4 4 I D 2 8 2 J E,G 6 8 7 K F.H 2 8 2 L F,H 5 5 5 M I,J,K 1 9 2 N L 6 8 7
