Term
|
Definition
| a diagram that represents system requirements as processes, external agents, data flows, and data stores |
|
|
Term
|
Definition
| a person or organization, outside the system boundary, that supplies data inputs or accepts data outputs |
|
|
Term
|
Definition
| a symbol on a dfd that represents an algorithm or procedure by which data inputs are transformed into data outputs |
|
|
Term
|
Definition
| an arrow on a dfd that represents data movement among processes, data stores, and external agents |
|
|
Term
|
Definition
| a place where data are held pending future access by one or more processes |
|
|
Term
|
Definition
| any modeling technique that breaks the system into a hierarchical set of increasingly more detailed models |
|
|
Term
|
Definition
| a dfd that sumarizes all processing activity within the system in a single process symbol |
|
|
Term
|
Definition
| a dfd that represents the system response to one event within a single process symbol |
|
|
Term
| event-partitioned system model, or diagram 0 |
|
Definition
| a dfd that models system requirements using a single process for each event in a system or subsystem |
|
|
Term
|
Definition
| difficulty in understanding that occurs when a reader recieves too much information at one time |
|
|
Term
|
Definition
| the rule of model design that limits the number of model components or connections among components to no more than nine |
|
|
Term
| minimization of interfaces |
|
Definition
| a principle of model design that seeks simplicity by limiting the number of connections among model components |
|
|
Term
|
Definition
| equivalence of data content between data flows entering and leaving a process and data flows entering and leaving a process decomposition dfd |
|
|
Term
|
Definition
| a process or data store with a data input that is never used to produce a data output |
|
|
Term
|
Definition
| a process or data store with a data element that is created out of nothing |
|
|
Term
|
Definition
| a method of writing process specifications that combines structured programming techniques with narrative english |
|
|
Term
|
Definition
| a tabular representation of processign logic containing decision variables, decision variable values, and actions or formulas |
|
|
Term
|
Definition
| a graphical decription of process logic that uses lines organized like branches of a tree |
|
|
Term
|
Definition
| a textual description of a data flow's content and internal structure |
|
|
Term
|
Definition
| a repository for definitions of data flows, data elements, and data stores |
|
|
Term
|
Definition
| a system development methodology that focuses on strategic planning, data modeling, and automated tools, and is thought to be more rigorous and complete than the structured approach |
|
|
Term
| process decompostion diagram |
|
Definition
| a model that represents the hierarchical relationship among processes at different levels of abstraction |
|
|
Term
| process dependency diagram |
|
Definition
| a model that describes the ordering of processes and their interaction with stored entities |
|
|
Term
|
Definition
| a diagram or map that identifies all of the processing locations of a system |
|
|
Term
|
Definition
| a table that describes the relationship between processes and the locations in which they are performed |
|
|
Term
|
Definition
| a table that describes stored data entities, the locations from which they are accessed, and the nature of the accesses |
|
|
Term
|
Definition
| acronym of create, read, update, and delete |
|
|
Term
|
Definition
| an indetifiable component of a computer program that performs a defined function |
|
|
Term
|
Definition
| an executable entity made up of a set of modules |
|
|
Term
|
Definition
| a diagram that describes the overall flow of control between computer programs in a system |
|
|
Term
|
Definition
| structured-programming-like statements that describe the logic of a module |
|
|
Term
|
Definition
| a hierarchical diagram showing the relationships between the modules of a computer program |
|
|
Term
|
Definition
| the transfer of control from a module to a subordinate module to perform a requested service |
|
|
Term
|
Definition
| the individual data items that are passed between modules in a program call |
|
|
Term
|
Definition
| the development of a structure chart based on a dfd that describes the processing for several types of transactions |
|
|
Term
|
Definition
| the development of a structure chart based on a dfd that describes the input-process-output data flow |
|
|
Term
|
Definition
| the incoming data flow from a sequential set of dfd processes |
|
|
Term
|
Definition
| the outgoing data flow in a sequential set of dfd processes |
|
|
Term
|
Definition
| set of dfd processes that are located between the input and output processes |
|
|
Term
|
Definition
| the manner in which modules relate to each other; the preferred method is data coupling |
|
|
Term
|
Definition
| a measure of internal strength of a module |
|
|
