A data processing manager is planning a project to install a new management information system. He is now read to start the project and wishes to finish in 26 weeks. After identifying the 14 separate activities needed to carry out this project, as well as their precedence relationship and estimated duration (in weeks), This manager has constructed the following project network:

Question One:

a) For each activity, find the earliest times ESD and EFD, the latest times LSD and LFD, and the floats TF and FF

b) Find all the paths and path lengths through this project network. Which is the critical path?

c) Will the manager be able to meet his deadline?

d) Which activities should he focus on first or pay attention to the most to stay on schedule?

M Start Finish EFD LSD LFD TF FF ACT A B Duration ESD 5 7 9 D E 4 3 5 F G 6 H 9 5 1 J || | | 5 K 8 L 3 6 M N 4