Assume you have a project with seven activities labeled a-g


Assume you have a project with seven activities Labeled A-G, as shown below. Derive the earliest completion time (or early finish time - EF), the latest completion time (or late finish - LF) and slack for each of the following tasks (begin at time =0).

Which tasks are on the critical path? Draw a Gantt Chart for these tasks.

Draw a Network Diagram for the tasks. Highlight the critical path.

Even guidance on drawing Gantt Chart and Network Diagram will do.

Task preceding Event Expected Duration

A - 5

B A 3

C A 4

D C 6

E B,C 4

F D 1

G D,E,F 5

Solution Preview :

Prepared by a verified Expert
C/C++ Programming: Assume you have a project with seven activities labeled a-g
Reference No:- TGS01248141

Now Priced at $20 (50% Discount)

Recommended (99%)

Rated (4.3/5)