โ† All CST Flashcard Decks

Scheduling Fundamentals & Techniques Flashcards

7 cards from real CST practice questions. Tap to flip, then mark Knew It or Still Learning โ€” missed cards come back until you master them.

Read the first 7 Scheduling Fundamentals & Techniques flashcards as text
  1. Which scheduling technique calculates the latest allowable start and finish times for each activity without delaying the project?

    Answer: Backward pass

    The backward pass computes Late Start (LS) and Late Finish (LF) by working from the project end date back to the start.

  2. A project has a Planned Value (PV) of $50,000 and an Earned Value (EV) of $40,000. What is the Schedule Variance (SV)?

    Answer: -$10,000

    SV = EV - PV = $40,000 - $50,000 = -$10,000, indicating the project is behind schedule.

  3. What does a Schedule Performance Index (SPI) value of 0.85 indicate?

    Answer: The project is earning $0.85 for every $1.00 of planned work

    SPI = EV/PV, so 0.85 means only $0.85 of work is being accomplished for every $1.00 of work that was planned.

  4. Which network diagramming method uses nodes to represent activities and arrows to show dependencies?

    Answer: Precedence Diagramming Method (PDM)

    PDM (also called Activity-on-Node) places activities in boxes/nodes and uses arrows solely to represent logical relationships.

  5. The technique of shortening the project schedule by overlapping activities that would normally be performed sequentially is called:

    Answer: Fast-tracking

    Fast-tracking overlaps sequential activities in parallel, accepting increased risk, while crashing adds resources to critical path activities.

  6. Which type of dependency represents a required, contractual, or physical limitation between activities?

    Answer: Mandatory dependency

    Mandatory dependencies (hard logic) are inherent in the nature of the work or required by contract and cannot be changed.

  7. A Finish-to-Start (FS) relationship with a lag of +5 days means:

    Answer: Successor cannot start until 5 days after predecessor finishes

    A positive lag on an FS relationship delays the start of the successor by the specified number of days after the predecessor finishes.