Which a successor activity cannot start until a predecessor activity has finished is known as:

A logical relationship in which a successor activity cannot start until a predecessor activity has finished is known as:
A. Start-to-start (SS).
B. Start-to-finish (SF).
C. Finish-to-start (FS).
D. Finish-to-finish (FF).

Download Printable PDF. VALID exam to help you PASS.

Leave a Reply

Your email address will not be published. Required fields are marked *


The reCAPTCHA verification period has expired. Please reload the page.