This is your description.
True
False
Process models
Data models
Flow models
Flow charts
Current physical
Current logical
Updated physical
New physical
Data modeling
Flow charting
Process modeling
Transition modeling
Context diagram
Level-2 diagram
Referencing diagram
Representative diagram
Context data flow diagram
Thorough descriptions of each DFD component
DFDs of the current logical system
State-transition diagram
How you should develop the system during physical design
What you learned during requirements determination
How you should implement the new system during implementation
What you learned during project planning
Process
Data flow
Source
Data store
Data store
Process
Source
Data flow
Source
Data store
Data flow
Process
Process
Source
Data flow
Data store
Process
Source
Data flow
Data store
Process
Source
Data flow
Data store
The interactions occurring between sources and sinks
How to provide sources and sinks direct access to stored data
How to control or redesign a source or sink
None of the above
Source/sink
Data store
Data flow
Process
Source/sink
Data store
Data flow
Process
Data store
Data flow
Process
Source/sink
Data store
Data flow
Process
Source/sink
Data store
Data flow
Process
Source/sink
Data store
Data flow
Process
Source/sink
Context diagram
Level-1 diagram
Level-0 diagram
Level-00 diagram
Share the same timing effects
Share the same data
Be coupled to each other
Be strapped to each other
Decouple the processes
Enables store and forward capabilities
Enhances the flow of data between the processes
Structures the processes
Has only inputs
Has only outputs
Cannot be exploded further
Has insufficient inputs to produce the associated processes
Data can move directly from one data store to another data store.
Data can move directly from a sink to a data store.
A data store has a noun phrase label
Data can move from an outside source to a data store.
Has only inputs
Has only outputs
Cannot be exploded further
Has insufficient inputs to produce the associated processes
A data flow may have multiple directions between symbols.
A data flow to a data store means retrieve or use.
A data flow from a data store means update.
A join in a data flow means that exactly the same data comes from any of two or more different processes, data stores, or sources/sinks to a common location.
Repeat data stores
Repeat sources/sinks
Repeat processes
Both a and b
Structuring
Balancing
Functional decomposition
Formatting
Level-0 diagrams
Context diagrams
Level-1 diagrams
Primitive data flow diagrams
Level-3 diagram
Level-1 diagram
Level-2 diagram
Primitive diagram
Decomposition
Balancing
Conservation
Data flow structuring
To avoid having data flow lines cross each other, data stores may be repeated on a DFD.
At the lowest level of DFDs, new data flows may be added to represent data that are transmitted under exceptional conditions.
Composite data flows on one level cannot be split into component data flows at the next level.
The inputs to a process must be sufficient to produce the outputs from the process.
Identifying which system functions will be automated and which will be manual
Having additional functions, removing obsolete functions, and reorganizing inefficient flows
Including an identification of the “technology” used to process the data
Representing the physical implementation of the new system
Gap proof
A primitive diagram
Complete
Consistent
DFD consistency
DFD completeness
DFD gap proofing
DFD flexibility
Violation of completeness
Violation of consistency
Gap
Structuring violation
DFD consistency
DFD completeness
DFD gap proofing
DFD flexibility
Level-0 diagrams
Level-1 diagrams
Primitive data flow diagrams
Level-3 diagrams
Context diagram
Level-0 diagram
Level-1 diagram
Primitive diagram
Double checking
Sequencing
Referencing
Gap analysis
Completeness
Consistency
Timing considerations
Iterative nature of drawing DFDs
Drawing primitive DFDs
Data flow diagram
Decision table
Decision tree
Structured English
Action statements
Rules
Condition statements
Decision stubs
Structure chart
State transition diagram
Decision table
Sequence diagram
Action stubs
Condition stubs
Condition list
Condition execution
Indifferent condition
Static condition
Fixed condition
Flexible condition
Rules 2, 4, and 6 are eliminated from the matrix
The number of rules is reduced by condensing Rules 2, 4, and 6 into one rule
Rules 2, 4, and 6 will result in at least two additional rules being included in the matrix
Rules 2, 4, and 6 have no impact on the interpretation of the matrix
Dash (-)
Asterisk (*)
Exclamation point (!)
Pound sign (#)
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.