Difficulty: Easy
Correct Answer: is partitioned according to the logical "closeness" of the actigrams
Explanation:
Introduction / Context:Data Flow Diagrams (DFDs) depict processes, data stores, and data flows. Functional decomposition breaks complex systems into manageable subsystems. The organizing principle is the logical cohesion of activities (processes)—not arbitrary groupings by files or ignoring the DFD entirely.
Given Data / Assumptions:
Concept / Approach:Partition the DFD so that processes which transform related inputs to related outputs (high functional cohesion) are grouped, while minimizing cross-boundary flows. This eases assignment to teams, clarifies interfaces, and supports modular design. Grouping solely by data stores (“datagrams”) risks mixing unrelated logic that happens to touch the same files.
Step-by-Step Solution:
Identify strongly related processes that pursue a single objective.Group these into candidate modules; keep data flows between groups as simple interfaces.Avoid partitions based only on shared files; use the logical purpose of activities.Select the option emphasizing logical closeness of activities.Verification / Alternative check:Structured analysis guidance recommends grouping by cohesion and separating by coupling, aligning with logical activity clusters shown on the DFD.
Why Other Options Are Wrong:
Common Pitfalls:Overfitting to current files; creating partitions with excessive cross-calls; ignoring future maintainability when drawing boundaries.
Final Answer:is partitioned according to the logical "closeness" of the actigrams
Discussion & Comments