Essay
1. Figure TB-4.1 is a "generic" level 0 data flow diagram (DFD), taken from Figure 4.5 in the text.
Required:
Using good data flow diagram construction techniques draw a diagram to explode bubble 3.0 to its next lower level. Diagram 3.0 should contain three processes, appropriately numbered, and should contain the following data flows in addition to those in the level 0 diagram (see NOTE):
a. Flow H runs from the first process to the second.
b. Flow I runs from the first process to the third.
c. Flows J and K run from the second process to the third.
NOTE: Assume that the flows shown in the level 0 diagram affect diagram 3.0 as follows:
1. Flow D runs to the first process in diagram 3.0.
2. Flow B runs from the third process in diagram 3.0.
3. The data flow running from the data store runs to the second process in diagram 3.0.
Correct Answer:

Verified
Correct Answer:
Verified
Q17: A(n) _ is the top-level, or least
Q18: A process in which successive layers of
Q19: An acceptance stub is a data flow
Q20: There can be only one correct logical
Q21: The successive subdividing, or "exploding," of physical
Q23: In which of the following data flow
Q24: Information processing activities include:<br>A) only automated activities<br>B)
Q25: Which of the following is the least
Q26: In a data flow diagram (DFD), a(n)
Q27: The following is a jumbled list of