82) Which of the following is a true statement regarding data flows?
A) A data flow to a data store means retrieve or use.
B) A data flow from a data store means update.
C) A data flow may have double-ended arrows.
D) A data flow represents data at rest.
E) A join in a data flow means that exactly the same data come from any of two or more different
processes, data stores, or sources/sinks to a common location.
Classification: Concept
83) On a data-flow diagram, you may:
A) repeat data stores and processes.
B) repeat sources/sinks and processes.
C) only repeat processes.
D) repeat relationships.
E) repeat both data stores and sources/sinks.
Classification: Concept
84) The act of going from a single system to several component processes refers to:
A) structuring.
B) balancing.
C) decomposition.
D) formatting.
E) regeneration.
Classification: Concept
19
85) The lowest level of DFDs are:
A) level-0 diagrams.
B) context diagrams.
C) level-1 diagrams.
D) primitive data-flow diagrams.
E) systematic diagrams.
Classification: Concept
86) A DFD that is a result of three nested decompositions of a series of subprocesses from a
process on a level-0 diagram describes a:
A) level-3 diagram.
B) level-1 diagram.
C) level-2 diagram.
D) primitive diagram.
E) context diagram.
Classification: Concept
87) The conservation of inputs and outputs is called:
A) decomposition.
B) balancing.
C) flow conservation.
D) data flow structuring.
E) gap proofing.
Classification: Concept
20
88) If a data flow appears on the context diagram and is also represented on a level-0 diagram,
this would be referred to as:
A) leveling.
B) flow conservation.
C) balancing.
D) cohesion.
E) coupling.
Classification: Concept
89) If an input from a source appears on a level-0 diagram, it must:
A) appear on the context diagram.
B) be connected to a data flow.
C) be connected to a sink.
D) be connected to a data store.
E) be connected to two entities.
Classification: Concept
90) If your DFD contains data flows that do not lead anywhere, it is not:
A) gap proof.
B) a primitive diagram.
C) complete.
D) consistent.
E) balanced.
Classification: Concept
21
91) The extent to which all necessary components of a data-flow diagram have been included
and fully described defines:
A) DFD consistency.
B) DFD completeness.
C) DFD gap proofing.
D) DFD flexibility.
E) DFD cohesion.
Classification: Concept
92) Having a level-1 diagram with no level-0 diagram is an example of a:
A) violation of completeness.
B) violation of consistency.
C) balancing error.
D) structuring violation.
E) cohesion error.
Classification: Application
93) The extent to which information contained on one level of a set of nested data-flow diagrams
is also included on other levels refers to:
A) DFD consistency.
B) DFD completeness.
C) DFD gap proofing.
D) DFD flexibility.
E) DFD cohesion.
Classification: Concept
22
94) When you believe that you have shown each business form or transaction, computer screen,
and report as a single data flow, you have probably reached the:
A) level-0 diagrams.
B) ternary-level diagrams.
C) primitive data-flow diagrams.
D) secondary-level diagrams.
E) context-level diagrams.
Classification: Application
95) The lowest level of decomposition for a data-flow diagram is called the:
A) context diagram.
B) level-0 diagram.
C) level-1 diagram.
D) primitive diagram.
E) cohesive diagram.
Classification: Concept
96) The process of discovering discrepancies between two or more sets of data-flow diagrams or
discrepancies within a single DFD is referred to as:
A) requirements structuring.
B) logic modeling.
C) DFD validation.
D) gap analysis.
E) DFD stress testing.
Classification: Concept
23
97) Techniques used for modeling system logic include:
A) flow charts.
B) decision tables.
C) data-flow diagrams.
D) dialogue charts.
E) entity-relationship diagrams.
Classification: Concept
98) The part of a decision table that links conditions to actions is the section that contains the:
A) action statements.
B) rules.
C) condition statements.
D) decision stubs.
E) relationship stubs.
Classification: Concept
99) The part of a decision table that lists the actions that result for a given set of conditions is
called:
A) action stubs.
B) condition stubs.
C) rule section.
D) execution stubs.
E) processing stubs.
Classification: Concept
24
100) Briefly describe the data-flow diagramming symbols. Provide one example of each.
Classification: Synthesis
101) Discuss the guidelines for drawing a DFD.
Classification: Synthesis
102) Briefly discuss how DFDs can be used as analysis tools.
projects
Classification: Synthesis
103) What is meant by DFD completeness? What is meant by DFD consistency?
Classification: Synthesis
25
104) What is gap analysis? Why is gap analysis useful?
Classification: Synthesis
26