Quiz 7: Structuring System Process Requirements
Computing
Q 1Q 1
A data flow diagram is a graphical tool that allows analysts to illustrate the flow of data in an information system.
Free
True False
True
Q 2Q 2
Logic modeling graphically represents the processes that capture,manipulate,store,and distribute data between a system and its environment and among components within a system.
Free
True False
False
Q 3Q 3
A primitive level data flow diagram is the first deliverable produced during requirements structuring.
Free
True False
False
Q 4Q 4
Data flow diagrams evolve from the more general to the more detailed as current and replacement systems are better understood.
Free
True False
Free
True False
Free
True False
Free
True False
Q 8Q 8
Assume shipment data is entered into a logbook once shipments are received at the company's warehouse; the logbook is represented on a data flow diagram as a sink.
Free
True False
Q 9Q 9
Assume your local veterinarian records information about each of his patients on patient medical history forms; the collection of medical history forms is represented on a data flow diagram as a data store.
Free
True False
Free
True False
Q 11Q 11
The determination of which items are low in stock is represented on a data flow diagram as a process.
Free
True False
Free
True False
Q 13Q 13
When constructing data flow diagrams,you should show the interactions that occur between sources and sinks.
Free
True False
Free
True False
Free
True False
Free
True False
Free
True False
Q 18Q 18
On a data flow diagram in the DeMarco and Yourdon model,two parallel lines represent a data store.
Free
True False
Q 19Q 19
A context diagram shows the scope of the organizational system,system boundaries,external entities that interact with the system,and major information flows between entities and the system.
Free
True False
Free
True False
Q 21Q 21
Because the system's data stores are conceptually inside one process,no data stores appear on a context diagram.
Free
True False
Q 22Q 22
A level-0 diagram is a data flow diagram that represents a system's major processes,data flows,and data stores at a high level of detail.
Free
True False
Q 23Q 23
Assume Process 7.4 produces a data flow and that Process 7.2 must be ready to accept it; we would say that these processes are physically linked to each other.
Free
True False
Q 24Q 24
Assume we have placed a data store between Process 5.1 and Process 5.5; we would say that these processes are decoupled.
Free
True False
Q 25Q 25
Because data flow names represent a specific set of data,another data flow that has even one more or one less piece of data must be given a different unique name.
Free
True False
Q 26Q 26
Functional decomposition is an iterative process of breaking the description of a system down into finer and finer detail.
Free
True False
Free
True False
Q 28Q 28
A fork in a data flow means that exactly the same data go from a common location to two or more different processes,data stores,or sources/sinks.
Free
True False
Free
True False
Free
True False
Q 31Q 31
More than one data flow noun phrase can appear on a single arrow as long as all of the flows on the same arrow move together as one package.
Free
True False
Free
True False
Free
True False
Free
True False
Free
True False
Q 36Q 36
As a rule of thumb,no data flow diagram should have more than about seven processes on it,because the diagram would be too crowded and difficult to understand.
Free
True False
Free
True False
Q 38Q 38
Coupling is the conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.
Free
True False
Q 39Q 39
To keep a data flow diagram uncluttered,you may repeat data stores,sinks/sources,and processes.
Free
True False
Q 40Q 40
A composite data flow on one level can be split into component data flows at the next level,but no new data can be added and all data in the composite must be accounted for in one or more subflows.
Free
True False
Q 41Q 41
Completeness,consistency,timing,iterative development,and primitive DFDs are guidelines for drawing DFDs.
Free
True False
Q 42Q 42
DFD cohesion means your DFDs include all of the necessary components for the system you are modeling.
Free
True False
Q 43Q 43
A data flow repository entry would include the composition or list of data elements contained in the data flow.
Free
True False
Free
True False
Q 45Q 45
One of the primary purposes of a DFD is to represent time,giving a good indication of whether data flows occur constantly in real time,once a day,or once a year.
Free
True False
Q 46Q 46
Structured analysis is the process of discovering discrepancies between two or more sets of data flow diagrams or discrepancies within a single DFD.
Free
True False
Q 47Q 47
To date,data flow diagrams have not been useful tools for modeling processes in business process reengineering.
Free
True False
Q 48Q 48
The principle of balancing and the goal of keeping a DFD as simple as possible led to four additional,advanced rules for drawing DFDs.
Free
True False
Free
True False
Free
True False
Q 51Q 51
Decision tables allow you to represent a set of conditions and the actions that follow from them in a tabular format.
Free
True False
Q 52Q 52
Make the decision table as simple as possible by removing any rules with impossible actions.
Free
True False
Q 53Q 53
A decision table is a matrix representation of the logic of a decision,which specifies the possible conditions for the decision and the resulting actions.
Free
True False
Q 54Q 54
Condition stubs are that part of a decision table that lists the actions that result for a given set of conditions.
Free
True False
Q 55Q 55
Action stubs are that part of a decision table that lists the conditions relevant to the decision.
Free
True False
Free
True False
Q 57Q 57
Rules are that part of the decision table that specify which actions are to be followed for a given set of conditions.
Free
True False
Q 58Q 58
Assume condition one has three values,condition two has four values,and condition three has two values; the number of rules required for the decision table is nine.
Free
True False
Q 59Q 59
Assume condition one has two values,condition two has five values,condition three has three values,and condition four has two values; the number of rules required for the decision table is sixty.
Free
True False
Q 60Q 60
An insignificant condition is a condition in a decision table whose value does not affect which actions are taken for two or more rules.
Free
True False
Free
True False
Q 62Q 62
If the different values for the employee type condition do not affect the action taken,then employee type is an indifferent condition.
Free
True False
Q 63Q 63
Referencing a decision table,a limited entry occurs when a condition has only two possible values.
Free
True False
Q 64Q 64
Referencing a decision table,an employee condition that has only two possible values is considered a limited entry.
Free
True False
Q 65Q 65
If an inventory item is either perishable or nonperishable,its condition is classified as an extended entry.
Free
True False
Free
True False
Free
True False
Free
True False
Q 69Q 69
Data flow diagrams that concentrate on the movement of data between processes are referred to as:
A)process models
B)data models
C)flow models
D)flow charts
Free
Multiple Choice
Q 70Q 70
Which of the following is not one of the four types of data flow diagrams?
A)current physical
B)current logical
C)updated physical
D)new physical
Free
Multiple Choice
Q 71Q 71
Graphically representing the functions,or processes,which capture,manipulate,store,and distribute data between a system and its environment and between components within a system refers to:
A)data modeling
B)flow charting
C)process modeling
D)transition modeling
Free
Multiple Choice
Q 72Q 72
The diagram that shows the scope of the system,indicating what elements are inside and which are outside the system,is called a:
A)context diagram
B)level-2 diagram
C)referencing diagram
D)representative diagram
Free
Multiple Choice
Q 73Q 73
Which of the following is not one of the primary deliverables resulting from studying and documenting a system's processes?
A)context data flow diagram (DFD)
B)thorough descriptions of each DFD component
C)DFDs of the current logical system
D)state-transition diagram
Free
Multiple Choice
Q 74Q 74
The deliverables of process modeling state:
A)how you should develop the system during physical design
B)what you learned during requirements determination
C)how you should implement the new system during implementation
D)what you learned during project planning
Free
Multiple Choice
Q 75Q 75
Student data contained on an enrollment form is represented on a data flow diagram as a:
A)process
B)data flow
C)source
D)data store
Free
Multiple Choice
Q 76Q 76
Data in motion,moving from one place in a system to another,defines:
A)data store
B)process
C)source
D)data flow
Free
Multiple Choice
Q 77Q 77
Data at rest,which may take the form of many different physical representations,defines:
A)source
B)data store
C)data flow
D)process
Free
Multiple Choice
Q 78Q 78
A file folder containing orders is represented on a data flow diagram as a:
A)process
B)source
C)data flow
D)data store
Free
Multiple Choice
Q 79Q 79
A computer-based file containing employee information is represented on a data flow diagram as a:
A)data flow
B)source
C)data store
D)process
Free
Multiple Choice
Q 80Q 80
Calculating an employee's salary is represented on a data flow diagram as a:
A)data flow
B)source
C)data store
D)process
Free
Multiple Choice
Q 81Q 81
Recording a customer's payment is represented on a data flow diagram as a:
A)process
B)source
C)data flow
D)data store
Free
Multiple Choice
Q 82Q 82
A supplier of auto parts to our company is represented on a data flow diagram as a:
A)process
B)source
C)data flow
D)data store
Free
Multiple Choice
Q 83Q 83
Which of the following is considered when diagramming?
A)the interactions occurring between sources and sinks
B)how to provide sources and sinks direct access to stored data
C)how to control or redesign a source or sink
D)none of the above
Free
Multiple Choice
Q 84Q 84
The work or actions performed on data so that they are transformed,stored,or distributed defines:
A)source/sink
B)data store
C)data flow
D)process
Free
Multiple Choice
Q 85Q 85
The origin and/or destination of data,sometimes referred to as external entities defines:
A)source/sink
B)data store
C)data flow
D)process
Free
Multiple Choice
Q 86Q 86
An arrow on a data flow diagram represents a:
A)data store
B)data flow
C)process
D)source/sink
Free
Multiple Choice
Q 87Q 87
A square on a data flow diagram represents a:
A)data store
B)data flow
C)process
D)source/sink
Free
Multiple Choice
Q 88Q 88
In the Gane and Sarson model,a rectangle with rounded corners on a data flow diagram represents a:
A)data store
B)data flow
C)process
D)source/sink
Free
Multiple Choice
Q 89Q 89
In the Gane and Sarson model,a rectangle that is missing its right vertical sides on a data flow diagram represents a:
A)data store
B)data flow
C)process
D)source/sink
Free
Multiple Choice
Q 90Q 90
Which of the following is a true statement regarding sources/sinks?
A)Sources/sinks are always outside the information system and define the boundaries of the system.
B)Data must originate outside a system from one or more sources.
C)The system must produce information to one or more sinks.
D)All of the above.
Free
Multiple Choice
Q 91Q 91
A data flow diagram that represents a system's major processes,data flows,and data stores at a high level of detail refers to:
A)context diagram
B)level-1 diagram
C)level-0 diagram
D)level-00 diagram
Free
Multiple Choice
Q 92Q 92
If two processes are connected by a data flow,they are said to:
A)share the same timing effects
B)share the same data
C)be coupled to each other
D)be strapped to each other
Free
Multiple Choice
Q 93Q 93
By placing a data store between two processes,this:
A)decouples the processes
B)enables store and forward capabilities
C)enhances the flow of data between the processes
D)structures the processes
Free
Multiple Choice
Q 94Q 94
The act of going from a single system to several component processes refers to:
A)structuring
B)balancing
C)functional decomposition
D)formatting
Free
Multiple Choice
Q 95Q 95
A miracle process is one that:
A)has only inputs
B)has only outputs
C)cannot be exploded further
D)has insufficient inputs to produce the associated processes
Free
Multiple Choice
Q 96Q 96
A black hole is one that:
A)has only inputs
B)has only outputs
C)has not been exploded to show enough detail
D)has insufficient inputs to produce the associated processes
Free
Multiple Choice
Q 97Q 97
Which of the following is a true statement regarding a data store?
A)Data can move directly from one data store to another data store.
B)Data can move directly from a sink to a data store.
C)A data store has a noun phrase label.
D)Data can move from an outside source to a data store.
Free
Multiple Choice
Q 98Q 98
Which of the following is a true statement regarding data flows?
A)A data flow may have multiple directions between symbols.
B)A data flow to a data store means retrieve or use.
C)A data flow from a data store means update.
D)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.
Free
Multiple Choice
Q 99Q 99
Which of the following is not a true statement regarding data flows?
A)A fork in a data flow means that exactly the same data goes from a common location to two or more different processes,data stores,or sources/sinks.
B)A data flow can go directly back to the same process it leaves.
C)A data flow has a noun phrase label.
D)A data flow has only one direction of flow between symbols.
Free
Multiple Choice
Q 100Q 100
On a data flow diagram,you may:
A)repeat data stores
B)repeat sources/sinks
C)repeat processes
D)both A and B
Free
Multiple Choice
Q 101Q 101
The lowest level of DFDs is called:
A)level-0 diagrams
B)context diagrams
C)level-1 diagrams
D)primitive data flow diagrams
Free
Multiple Choice
Q 102Q 102
A DFD that is a result of three nested decompositions of a series of subprocesses from a process on a level-0 diagram defines a:
A)level-3 diagram
B)level-1 diagram
C)level-2 diagram
D)primitive diagram
Free
Multiple Choice
Q 103Q 103
The conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level defines:
A)decomposition
B)balancing
C)conservation
D)data flow structuring
Free
Multiple Choice
Q 104Q 104
If a data flow appears on the context diagram and is also represented at level-0,this would be referred to as:
A)leveling
B)flow conservation
C)balancing
D)matching
Free
Multiple Choice
Q 105Q 105
If an input from a source appears at level-0,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
Free
Multiple Choice
Q 106Q 106
Which of the following is not an advanced rule governing data flow diagramming?
A)To avoid having data flow lines cross each other,data stores may be repeated on a DFD.
B)At the lowest level of DFDs,new data flows may be added to represent data that are transmitted under exceptional conditions.
C)Composite data flows on one level cannot be split into component data flows at the next level.
D)The inputs to a process must be sufficient to produce the outputs from the process.
Free
Multiple Choice
Q 107Q 107
The new logical model will differ from the current logical model by:
A)identifying which system functions will be automated and which will be manual
B)having additional functions,removing obsolete functions,and reorganizing inefficient flows
C)including an identification of the "technology" used to process the data
D)representing the physical implementation of the new system
Free
Multiple Choice
Q 108Q 108
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
Free
Multiple Choice
Q 109Q 109
The extent to which all necessary components of a data flow diagram have been included and fully described refers to:
A)DFD consistency
B)DFD completeness
C)DFD gap proofing
D)DFD flexibility
Free
Multiple Choice
Q 110Q 110
Having a level-1 diagram with no level-0 diagram is an example of a:
A)violation of completeness
B)violation of consistency
C)gap
D)structuring violation
Free
Multiple Choice
Q 111Q 111
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
Free
Multiple Choice
Q 112Q 112
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)level-1 diagrams
C)primitive data flow diagrams
D)level-3 diagrams
Free
Multiple Choice
Q 113Q 113
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
Free
Multiple Choice
Q 114Q 114
The process in analysis in which the analyst tries to discover discrepancies between two or more sets of data flow diagrams,representing two or more states of an information system,or discrepancies within a single DFD,is referred to as:
A)double checking
B)sequencing
C)referencing
D)gap analysis
Free
Multiple Choice
Q 115Q 115
Guidelines for drawing DFDs include the following except for:
A)completeness
B)consistency
C)numbering considerations
D)timing considerations
Free
Multiple Choice
Q 116Q 116
A DFD that is the result of n nested decompositions from a process on a level-0 diagram,is called:
A)primitive diagram
B)level-0 diagram
C)context diagram
D)level-n diagram
Free
Multiple Choice
Q 117Q 117
A process has a:
A)pronoun label
B)adjective label
C)verb phrase label
D)noun phrase label
Free
Multiple Choice
Q 118Q 118
A modeling technique that allows you to represent a set of conditions and the actions that follow from them in a tabular format best describes:
A)data flow diagram
B)decision table
C)flowchart
D)Structured English
Free
Multiple Choice
Free
Multiple Choice
Q 120Q 120
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
Free
Multiple Choice
Q 121Q 121
A matrix representation of the logic of a decision,which specifies the possible conditions for the decision and the resulting actions,defines a:
A)structure chart
B)state transition diagram
C)decision table
D)sequence diagram
Free
Multiple Choice
Q 122Q 122
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)condition execution
Free
Multiple Choice
Q 123Q 123
The part of a decision table that lists the conditions relevant to the decision is called:
A)action stubs
B)condition stubs
C)condition list
D)condition execution
Free
Multiple Choice
Q 124Q 124
The part of a decision table that specifies which actions are to be followed for a given set of conditions refers to:
A)action stubs
B)condition list
C)rules
D)decision list
Free
Multiple Choice
Q 125Q 125
In a decision table,a condition whose value does not affect which actions are taken for two or more rules is referred to as a(n):
A)indifferent condition
B)static condition
C)fixed condition
D)flexible condition
Free
Multiple Choice
Q 126Q 126
If Rules 2,4,and 6 are indifferent conditions,then:
A)Rules 2,4,and 6 are eliminated from the matrix
B)the number of rules is reduced by condensing Rules 2,4,and 6 into one rule
C)Rules 2,4,and 6 will result in at least two additional rules being included in the matrix
D)Rules 2,4,and 6 have no impact on the interpretation of the matrix
Free
Multiple Choice
Q 127Q 127
An indifferent condition is represented by a(n):
A)dash (-)
B)asterisk (*)
C)exclamation point (!)
D)pound sign (#)
Free
Multiple Choice
Q 128Q 128
Basic procedures for constructing a decision table do not include:
A)listing all possible rules
B)naming the conditions and the values each condition can assume
C)identifying selection criteria
D)simplifying the decision table
Free
Multiple Choice
Q 129Q 129
When condition values are either "yes" or "no",these values are called a(n):
A)extended entry
B)simple entry
C)complex entry
D)limited entry
Free
Multiple Choice
Q 130Q 130
A condition that has more than two values is a(n):
A)extended entry
B)simple entry
C)complex entry
D)limited entry
Free
Multiple Choice
Q 131Q 131
To determine the number of rules required for the decision table,you would:
A)add the number of values for each condition to the number of values for every other condition
B)multiply the number of conditions by two
C)add the number of values for each condition to the number of values for every other condition,then subtract 1
D)multiply the number of values for each condition by the number of values for every other condition
Free
Multiple Choice
Q 132Q 132
Assume we have three conditions.Condition one has two values; condition two has three values; condition three has three values.How many rules are needed?
A)8
B)6
C)5
D)18
Free
Multiple Choice
Q 133Q 133
Assume the first condition has two values; the second condition has two values; the third condition has three values.How many rules will there be?
A)7
B)12
C)6
D)11
Free
Multiple Choice
Q 134Q 134
Assume the first condition has four values; the second condition has two values; the third condition has two values.How many rules will there be?
A)8
B)7
C)16
D)24
Free
Multiple Choice
Q 135Q 135
A decision table is simplified by:
A)removing extended entries
B)removing any rules with impossible actions
C)removing simple entries
D)removing any rules with static actions
Free
Multiple Choice
Q 136Q 136
Removing any rules with impossible actions to make which of the following simple as possible?
A)activity diagram
B)decision table
C)structure chart
D)hierarchical chart
Free
Multiple Choice
Q 137Q 137
A __________ represents data at rest,which may take the form of many different physical representations.
Free
Short Answer
Q 138Q 138
On a data flow diagram,supplier information kept in a notebook is represented as a __________.
Free
Short Answer
Q 139Q 139
__________ are the works or actions performed on data so that they are transformed,stored,or distributed.
Free
Short Answer
Free
Short Answer
Free
Short Answer
Free
Short Answer
Free
Short Answer
Free
Short Answer
Q 145Q 145
A __________ is a data flow diagram of the scope of an organizational system that shows the system boundaries,external entities that interact with a system,and the major information flows between entities and the system.
Free
Short Answer
Q 146Q 146
A __________ is a data flow diagram that represents a system's major processes,data flows,and data stores at a high level of detail.
Free
Short Answer
Q 147Q 147
A __________ is a picture of the movement of data between external entities and the processes and the data stores within a system.
Free
Short Answer
Q 148Q 148
__________ is an iterative process of breaking the description of a system down into finer and finer detail,which creates a set of charts in which one process on a given chart is explained in greater detail on another chart.
Free
Short Answer
Q 149Q 149
A __________ is a DFD that is the result of n nested decomposition of a series of subprocesses from a process on a level-0 diagram.
Free
Short Answer
Q 150Q 150
__________ is the conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.
Free
Short Answer
Q 151Q 151
__________ is the extent to which all necessary components of a data flow diagram have been included and fully described.
Free
Short Answer
Q 152Q 152
If your DFD contains data flows that do not lead anywhere,then your DFD violates the __________ guideline.
Free
Short Answer
Q 153Q 153
The five guidelines for drawing DFDs include __________,__________,__________,the __________,and __________.
Free
Essay
Q 154Q 154
__________ is the extent to which information contained on one level of a set of nested data flow diagrams is also included on other levels.
Free
Short Answer
Q 155Q 155
If a data flow appears on a higher-level DFD but not on lower levels,this situation violates the __________ guideline.
Free
Short Answer
Free
Short Answer
Q 157Q 157
__________ is the process of discovering discrepancies between two or more sets of data flow diagrams or discrepancies within a single DFD.
Free
Short Answer
Free
Short Answer
Free
Short Answer
Free
Short Answer
Free
Short Answer
Q 162Q 162
A __________ is a matrix representation of the logic of a decision,which specifies the possible conditions for the decision and the resulting actions.
Free
Short Answer
Q 163Q 163
__________ are the part of a decision table that lists the conditions relevant to the decision.
Free
Short Answer
Q 164Q 164
__________ are the part of a decision table that lists the actions that result for a given set of conditions.
Free
Short Answer
Q 165Q 165
__________ are the part of a decision table that specifies which actions are to be followed for a given set of conditions.
Free
Short Answer
Free
Short Answer
Q 167Q 167
The __________ section is the part of the decision table that link the conditions to actions.
Free
Short Answer
Q 168Q 168
An __________ is a condition in a decision table whose value does not affect which actions are taken for two or more rules.
Free
Short Answer
Free
Short Answer
Q 170Q 170
If condition one has four values,condition two has five values,condition three has two values,and condition four has three values,then the number of rules required for the decision table is __________.
Free
Short Answer
Free
Short Answer
Free
Short Answer
Q 173Q 173
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-Data in motion,moving from one place in a system to another.
Free
Short Answer
Q 174Q 174
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-A data flow diagram that represents a system's major processes,data flows,and data stores at a high level of detail.
Free
Short Answer
Q 175Q 175
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.
Free
Short Answer
Q 176Q 176
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The origin and/or destination of data,sometimes referred to as external entities.
Free
Short Answer
Q 177Q 177
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The extent to which all necessary components of a data flow diagram have been included and fully described.
Free
Short Answer
Q 178Q 178
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The work or actions performed on data so that they are transformed,stored,or distributed.
Free
Short Answer
Q 179Q 179
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The extent to which information contained on one level of a set of nested data flow diagrams is also included on other levels.
Free
Short Answer
Q 180Q 180
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The process of discovering discrepancies between two or more sets of data flow diagrams or discrepancies within a single DFD.
Free
Short Answer
Q 181Q 181
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-Data at rest,which may take the form of many different physical representations.
Free
Short Answer
Q 182Q 182
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-The lowest level of decomposition for a data flow diagram.
Free
Short Answer
Q 183Q 183
Match each of the following terms with its description.
a.source/sink
b.level-0 diagram
c.data flow
d.data store
e.balancing
f.DFD completeness
g.DFD consistency
h.level-n diagram
i.primitive DFD
j.process
k.gap analysis
-A DFD that is the result of n nested decompositions from a process on a level-0 diagram.
Free
Short Answer
Q 184Q 184
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Customer order form
Free
Short Answer
Q 185Q 185
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Customer
Free
Short Answer
Q 186Q 186
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Generate paycheck
Free
Short Answer
Q 187Q 187
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Calculating overtime pay
Free
Short Answer
Q 188Q 188
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Sales report
Free
Short Answer
Q 189Q 189
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Computing a grade point average
Free
Short Answer
Q 190Q 190
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Preparing a purchase order
Free
Short Answer
Q 191Q 191
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Teller
Free
Short Answer
Q 192Q 192
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Student enrollment file
Free
Short Answer
Q 193Q 193
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Supplier
Free
Short Answer
Q 194Q 194
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Data can move directly from one data store to another data store.
Free
Short Answer
Q 195Q 195
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A process has a noun phrase label.
Free
Short Answer
Q 196Q 196
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Objects on a DFD have unique names.
Free
Short Answer
Q 197Q 197
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data flow to a data store means update.
Free
Short Answer
Q 198Q 198
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Data can move directly from an outside source to a data store.
Free
Short Answer
Q 199Q 199
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data store has a verb phrase label.
Free
Short Answer
Q 200Q 200
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data flow is bi-directional between symbols.
Free
Short Answer
Q 201Q 201
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-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.
Free
Short Answer
Q 202Q 202
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-The inputs to a process are different from the outputs of that process.
Free
Short Answer
Q 203Q 203
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A process can have only inputs.
Free
Short Answer
Q 204Q 204
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Data cannot move directly to an outside sink from a data store.
Free
Short Answer
Q 205Q 205
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data flow has a verb phrase label.
Free
Short Answer
Q 206Q 206
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data flow cannot go directly back to the same process it leaves.
Free
Short Answer
Q 207Q 207
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A source/sink has a noun phrase label.
Free
Short Answer
Q 208Q 208
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A fork in a data flow means that exactly the same data goes from a common location to two or more different processes,data stores,or sources/sinks.
Free
Short Answer
Q 209Q 209
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-Data can move directly from a source to a sink.
Free
Short Answer
Q 210Q 210
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A data flow from a data store means retrieve or use.
Free
Short Answer
Q 211Q 211
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-There must be at least one other process that handles the data flow,produces some other data flow,and returns the original data flow to the beginning process.
Free
Short Answer
Q 212Q 212
Match each of the data flow diagramming symbols with corresponding examples.(Answers may occur more than once.)
a.process
b.data flow
c.source/sink
d.data store
-A process must have both inputs and outputs.
Free
Short Answer
Q 213Q 213
Match each of the following terms with its description.
a.gap analysis
b.functional decomposition
c.process modeling
d.balancing
e.DFD completeness
-Graphically representing the functions that capture,manipulate,store,and distribute data between a system and its environment and between components within a system.
Free
Short Answer
Q 214Q 214
Match each of the following terms with its description.
a.gap analysis
b.functional decomposition
c.process modeling
d.balancing
e.DFD completeness
-Breaking a larger system into smaller subsystems or processes.
Free
Short Answer
Q 215Q 215
Match each of the following terms with its description.
a.gap analysis
b.functional decomposition
c.process modeling
d.balancing
e.DFD completeness
-Using data flow diagrams to discover discrepancies between two or more sets of data flow diagrams,representing two or more states of an information system,or discrepancies within a single DFD.
Free
Short Answer
Q 216Q 216
Match each of the following terms with its description.
a.gap analysis
b.functional decomposition
c.process modeling
d.balancing
e.DFD completeness
-The extent to which all necessary components of a data flow diagram have been included and fully described.
Free
Short Answer
Q 217Q 217
Match each of the following terms with its description.
a.gap analysis
b.functional decomposition
c.process modeling
d.balancing
e.DFD completeness
-The conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.
Free
Short Answer
Q 218Q 218
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-A matrix representation of the logic of a decision,which specifies the possible conditions for the decision and the resulting actions.
Free
Short Answer
Q 219Q 219
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-The part of the decision table that lists the actions that result for a given set of conditions.
Free
Short Answer
Q 220Q 220
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-Occurs when the condition values are simply "yes" or "no."
Free
Short Answer
Q 221Q 221
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-The part of the decision table that specifies which actions are to be followed for a given set of conditions.
Free
Short Answer
Q 222Q 222
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-The part of a decision table that lists the conditions relevant to the decision.
Free
Short Answer
Q 223Q 223
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-Occurs when the condition values are more than two.
Free
Short Answer
Q 224Q 224
Match each of the following terms with its corresponding description.
a.limited entry
b.extended entry
c.action stubs
d.condition stubs
e.decision table
f.indifferent condition
g.rules
-This occurs when a value does not affect which actions are taken for two or more rules.
Free
Short Answer
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Q 233Q 233
For the following situation,draw a context-level diagram and a level-0 data flow diagram.Kellogg State Bank provides car and home loans to its banking customers.Initially,a potential loan customer meets with a Kellogg loan officer,requests a loan for a certain amount and time frame,and completes a loan application.Next,the loan officer determines the customer's credit standing,the type of loan required,and available interest rates.While the loan officer can authorize car loans for credit worthy customers,a loan committee must approve all home loans.
Free
Essay
Free
Essay
Free
Essay
Q 236Q 236
An individual wishes to withdraw cash from an ATM machine.Prepare a decision table to represent this situation.Please note any assumptions that you make.
Free
Essay