Quiz 7: Structuring System Process Requirements

A data flow diagram is a graphical tool that allows analysts to illustrate the flow of data in an information system.

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.

A primitive level data flow diagram is the first deliverable produced during requirements structuring.

Data flow diagrams evolve from the more general to the more detailed as current and replacement systems are better understood.

A data flow represents data in motion,moving from one place in the system to another.

On a data flow diagram,a paycheck is represented as a data store.

A customer order is represented on a data flow diagram as a data flow.

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.

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.

The calculation of a student's grade is represented on a data flow diagram as a data flow.

The determination of which items are low in stock is represented on a data flow diagram as a process.

Sources and sinks are internal to the system.

When constructing data flow diagrams,you should show the interactions that occur between sources and sinks.

The data a sink receives and often what data a source provides are fixed.

A Web site's customer is represented as a source on a data flow diagram.

On a data flow diagram,an arrow represents an action,such as calculating an employee's pay.

On a data flow diagram,a diamond represents a process.

On a data flow diagram in the DeMarco and Yourdon model,two parallel lines represent a data store.

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.

Context diagrams have only one process labeled "P-1."

Because the system's data stores are conceptually inside one process,no data stores appear on a context diagram.

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.

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.

Assume we have placed a data store between Process 5.1 and Process 5.5; we would say that these processes are decoupled.

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.

Functional decomposition is an iterative process of breaking the description of a system down into finer and finer detail.

A data flow can go directly back to the same process it leaves.

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.

A data flow to a data store means update.

Data cannot move directly from a source to a sink.

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.

A process has a verb phrase label.

Double-ended arrows are used to represent data flowing in both directions.

The lowest-level data flow diagrams are called level-0 diagrams.

The decomposition of Process 1.1 is shown on a level-1 diagram.

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.

The decomposition of Process 2.4.3.4 is shown on a level-4 diagram.

Coupling is the conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.

To keep a data flow diagram uncluttered,you may repeat data stores,sinks/sources,and processes.

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.

Completeness,consistency,timing,iterative development,and primitive DFDs are guidelines for drawing DFDs.

DFD cohesion means your DFDs include all of the necessary components for the system you are modeling.

A data flow repository entry would include the composition or list of data elements contained in the data flow.

A gross violation of DFD consistency would be a level-1 diagram with no level-0 diagram.

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.

Structured analysis is the process of discovering discrepancies between two or more sets of data flow diagrams or discrepancies within a single DFD.

To date,data flow diagrams have not been useful tools for modeling processes in business process reengineering.

The principle of balancing and the goal of keeping a DFD as simple as possible led to four additional,advanced rules for drawing DFDs.

Inefficiencies cannot be identified by studying DFDs.

Data flow diagrams aren't versatile enough to be used as tools for process modeling.

Decision tables allow you to represent a set of conditions and the actions that follow from them in a tabular format.

Make the decision table as simple as possible by removing any rules with impossible actions.

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.

Condition stubs are that part of a decision table that lists the actions that result for a given set of conditions.

Action stubs are that part of a decision table that lists the conditions relevant to the decision.

Referencing a decision table,specific combinations of conditions trigger specific actions.

Rules are that part of the decision table that specify which actions are to be followed for a given set of conditions.

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.

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.

An insignificant condition is a condition in a decision table whose value does not affect which actions are taken for two or more rules.

In a decision table,an indifferent condition is represented by an asterisk.

If the different values for the employee type condition do not affect the action taken,then employee type is an indifferent condition.

Referencing a decision table,a limited entry occurs when a condition has only two possible values.

Referencing a decision table,an employee condition that has only two possible values is considered a limited entry.

If an inventory item is either perishable or nonperishable,its condition is classified as an extended entry.

Referencing a decision table,every possible combination of conditions must be represented.

Referencing a decision table,an action is provided for each rule.

Decision tables support nested conditions.

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

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

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

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

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

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

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

Data in motion,moving from one place in a system to another,defines: A)data store B)process C)source D)data flow

Data at rest,which may take the form of many different physical representations,defines: A)source B)data store C)data flow D)process

A file folder containing orders is represented on a data flow diagram as a: A)process B)source C)data flow D)data store

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

Calculating an employee's salary is represented on a data flow diagram as a: A)data flow B)source C)data store D)process

Recording a customer's payment is represented on a data flow diagram as a: A)process B)source C)data flow D)data store

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

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

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

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

An arrow on a data flow diagram represents a: A)data store B)data flow C)process D)source/sink

A square on a data flow diagram represents a: A)data store B)data flow C)process D)source/sink

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

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

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.

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

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

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

The act of going from a single system to several component processes refers to: A)structuring B)balancing C)functional decomposition D)formatting

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

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

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.

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.

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.

On a data flow diagram,you may: A)repeat data stores B)repeat sources/sinks C)repeat processes D)both A and B

The lowest level of DFDs is called: A)level-0 diagrams B)context diagrams C)level-1 diagrams D)primitive data flow diagrams

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

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

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

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

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.

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

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

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

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

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

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

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

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

Guidelines for drawing DFDs include the following except for: A)completeness B)consistency C)numbering considerations D)timing considerations

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

A process has a: A)pronoun label B)adjective label C)verb phrase label D)noun phrase label

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

A decision table does not include: A)statements B)condition stubs C)action stubs D)rules

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

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

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

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

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

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

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

An indifferent condition is represented by a(n): A)dash (-) B)asterisk (*) C)exclamation point (!) D)pound sign (#)

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

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

A condition that has more than two values is a(n): A)extended entry B)simple entry C)complex entry D)limited entry

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

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

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

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

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

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

A __________ represents data at rest,which may take the form of many different physical representations.

On a data flow diagram,supplier information kept in a notebook is represented as a __________.

__________ are the works or actions performed on data so that they are transformed,stored,or distributed.

Determining an employee's schedule is an example of a __________.

__________ is the origin and/or destination of data.

An __________ represents a data flow.

In the DeMarco and Yourdon model,the symbol for a data store is __________.

The symbol for sources/sinks is a __________.

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.

A __________ is a data flow diagram that represents a system's major processes,data flows,and data stores at a high level of detail.

A __________ is a picture of the movement of data between external entities and the processes and the data stores within a system.

__________ 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.

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.

__________ is the conservation of inputs and outputs to a data flow diagram process when that process is decomposed to a lower level.

__________ is the extent to which all necessary components of a data flow diagram have been included and fully described.

If your DFD contains data flows that do not lead anywhere,then your DFD violates the __________ guideline.

The five guidelines for drawing DFDs include __________,__________,__________,the __________,and __________.

__________ is the extent to which information contained on one level of a set of nested data flow diagrams is also included on other levels.

If a data flow appears on a higher-level DFD but not on lower levels,this situation violates the __________ guideline.

A __________ is the lowest level of decomposition for a data flow diagram.

__________ is the process of discovering discrepancies between two or more sets of data flow diagrams or discrepancies within a single DFD.

Data flow diagrams are useful for modeling processes in __________.

Learning the mechanics of drawing __________ is important.

__________ on a DFD have unique names.

The __________ to a process are different from the outputs of that process.

A __________ is a matrix representation of the logic of a decision,which specifies the possible conditions for the decision and the resulting actions.

__________ are the part of a decision table that lists the conditions relevant to the decision.

__________ are the part of a decision table that lists the actions that result for a given set of conditions.

__________ are the part of a decision table that specifies which actions are to be followed for a given set of conditions.

The three parts of a decision table are __________,__________,and __________.

The __________ section is the part of the decision table that link the conditions to actions.

An __________ is a condition in a decision table whose value does not affect which actions are taken for two or more rules.

In a decision table,an indifferent condition is represented with a __________.

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 __________.

When you first create a __________,you have to create an exhaustive set of rules.

When constructing a __________,you usually follow a set of basic procedures.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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

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

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

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

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

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

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

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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."

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.

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.

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.

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.

Discuss the guidelines for drawing a DFD.

Briefly describe the data flow diagramming symbols.Provide one example of each.

Briefly discuss how DFDs can be used as analysis tools.

What is meant by DFD completeness? What is meant by DFD consistency?

What is gap analysis? Why is gap analysis useful?

What is process modeling? Identify three types of process models.

Identify six concrete rules for stopping the decomposition process.

Identify the deliverables for process modeling.

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.

Briefly discuss modeling logic with decision tables.

Identify the five basic procedures to follow when constructing a decision table.

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.