CH DFD (test bank) Flashcards

1
Q

T/F: The traditional approach to system development views a system as a collection of interacting objects

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

T/F: Traditional computer processes are much like procedural computer programs in that they contain instructions that execute in sequence.

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

T/F: The object-oriented approach to systems development views a system as a collection of processes, some performed by people and some performed by the computer.

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

T/F: The term “diagram 0” is used synonymously with context diagram.

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

T/F: System boundaries are not shown clearly on context diagrams.

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

T/F: Diagram 0 summarizes an entire system or subsystem in greater detail than a context diagram.

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

T/F: Context diagrams do not usually show data stores.

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The traditional approach to information systems development describes activities as ____.
a. processes carried out by people or computers
b. objects that interact with people and each other
c. objects that send and respond to messages
d. activities that require computational support

A

a. processes carried out by people or computers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

A(n) ____ is a person or organization outside the system boundary that supplies data inputs or accepts data outputs.
a. data flow c. external agent
b. data store d. customer

A

c. external agent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Which of the following refers to a modeling technique that breaks the system into a hierarchical set of increasingly more detailed models?
a. Data store c. Data flow
b. Level of abstraction d. Context diagram

A

b. Level of abstraction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A(n) ____ is a data flow diagram (DFD) that summarizes all processing activity within the system in a single process symbol.
a. Event partition diagram c. Diagram 0
b. level of abstraction d. context diagram

A

d. context diagram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A(n) ____ represents the system response to one event.
a. DFD fragment c. diagram 0
b. context diagram d. event-partitioned system model

A

a. DFD fragment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A data flow diagram (DFD) that models system requirements using a single process for each event in a system or subsystem is called a(n) ____.
a. context diagram c. event-partitioned system model
b. DFD fragment d. diagram 1.0

A

c. event-partitioned system model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

The term diagram 0 is another name for a(n) ____.
a. context diagram c. event-partitioned system model
b. DFD fragment d. lowest level diagram

A

c. event-partitioned system model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

If the data flow diagram (DFD) is a ____, then it assumes that the system will be implemented with perfect technology.
a. context diagram c. physical model
b. logical model d. prototype model

A

c. physical model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

A(n) ____ can be a physical system model, a logical system model, or a blend of the two.
a. process definition c. entity-relationship diagram
b. data flow diagram d. context diagram

A

b. data flow diagram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Which of the following data flow diagram (DFD) symbols usually corresponds to a data entity on an entity-relationship diagram (ERD)?
a. Data store c. Data link
b. Data flow d. Process

A

a. Data store

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Which of the following data flow diagram (DFD) symbols represents the communication between an external agent and a process while the process is executing?
a. Process c. Real-time link
b. Data link d. Data store

A

c. Real-time link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

An analyst can avoid information overload by adhering to the rule of ____.
a. functional decomposition c. process dependency
b. interface minimization d. balancing

A

b. interface minimization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

____ is the equivalence of data content between data flows entering and leaving a process and data flows entering and leaving a process decomposition data flow diagram (DFD).
a. Balancing c. Complexity minimization
b. Interface minimization d. Abstraction

A

a. Balancing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Minimization of interfaces is directly related to the rule of ____.
a. miracle c. balancing
b. black hole d. 7 ± 2

A

d. 7 ± 2

22
Q

On a DFD a(n) ____ represents a file or part of a database that stores information about a data entity.
a. process c. data store
b. data flow d. data link

A

c. data store

23
Q

Which of the following is NOT a technique to document program logic for a process.
a. Structured English c. Decision Tree
b. Decision Matrix d. Decision Table

A

b. Decision Matrix

24
Q

Analysts sometimes can spot black holes and miracles simply by examining the _________.
a. context diagram c. data flow diagram
b. entity relationship diagram d. structured English

A

c. data flow diagram

25
Q

Which of the following is a table that describes the relationship between processes and the locations in which they are performed?
a. Location diagram c. Activity-location matrix
b. Black hole d. Activity-data matrix

A

c. Activity-location matrix

26
Q

Which of the following is a diagram or map that identifies all of the processing locations of a system?
a. Location diagram c. Activity-data matrix
b. Activity-location matrix d. CRUD table

A

a. Location diagram

27
Q

A ____ is a textual description of a data flow’s content and internal structure.
a. data store rule c. data flow rule
b. data flow definition d. process definition

A

b. data flow definition

28
Q

In small development projects, a(n) ____ may be a small loose-leaf notebook or word processing file.
a. data store c. activity-data matrix
b. data dictionary d. decision table

A

b. data dictionary

29
Q

A symbol on a data flow diagram (DFD) that represents an algorithm or procedure by which data inputs are transformed into data outputs is called a(n) ____.
a. process c. activity
b. transaction d. data flow

A

a. process

30
Q

A diagram that represents system requirements as processes, external agents, data flows, and data stores is called a(n) ______.

A

data flow diagram (DFD)

31
Q

A symbol on a data flow diagram (DFD) that represents an algorithm or procedure by which data inputs are transformed into data outputs is called a(n) __________.

A

process

32
Q

A place where data are held pending future access by one or more processes in a DFD is called a(n) ________.

A

data store

33
Q

A(n) ________ is a data flow diagram (DFD) that summarizes all processing activity within the system in a single process symbol.

A

context diagram

34
Q

A DFD _______ represents the system response to one event within a single process symbol.

A

fragment

35
Q

An assumption about DFDs that includes things such as instant processing, infinite storage, and zero errors is called ______.

A

perfect internal technology

35
Q

A data flow diagram (DFD) that models system requirements using a single process for each event in a system or subsystem is called a(n) ____.

A

event-partitioned system model
diagram 0

36
Q

If too much information is presented at once, people experience a phenomenon called _______ .

A

information overload

37
Q

The rule of 7 ± 2 is also known as _________.

A

Miller’s number

38
Q

_________ is a principle of model design that seeks simplicity by limiting the number of connections among model components.

A

minimization of interfaces

39
Q

The term “__________” is used to describe the equivalence of data content between data flows entering and leaving a process and data flows entering and leaving a process decomposition data flow diagram (DFD).

A

balancing

40
Q

A process or data store with data input that is never used to produce a data output is referred to as a(n) ______.

A

black hole

41
Q

___________ is a method of writing process specifications that combines structure programming techniques with narrative English.

A

Structured English

41
Q

A(n) _______ is a process or data store with a data element that is created out of nothing.

A

miracle

42
Q

___________ can summarize decision logic more concisely than structured English.

A

decision tables

43
Q

A(n) ________ is a graphical description of process logic that uses lines organized like branches of a tree.

A

decision tree

43
Q

A(n) _______ is a tabular representation of processing logic containing decision variables, decision variable values, and actions or formulas.

A

decision table

44
Q

A(n) ________ is a table that describes stored data entities, the locations from which they are accessed, and the nature of the accesses.

A

activity-data matrix

45
Q

Explain the difference between traditional and object-oriented approaches to system development.

A

The traditional and the object-oriented approaches to system development differ in how a system’s response to an event is modeled and implemented. The traditional approach views a system as a collection of processes, some performed by people and some performed by computers. In contrast, the object-oriented approach views a system as a collection of interacting objects. Objects are capable of behaviors that allow them to interact with each other and with people using the system.

46
Q

List the five symbols used on a data flow diagram (DFD) and briefly explain what each symbol represents.

A

A process (rectangle with rounded corners) represents transformation of data input(s) into data output(s).
A data flow (straight arrow) represents movement of data among processes, data stores, and external agents.
An external agent (square) represents a person, organization, or system outside the system boundary that supplies or receives data.
A data store (rectangle with one end open) represents data stored for later retrieval.
A real-time link (arrow with a double bend) represents exchange of data between a process and an external agent while the process is executing.

47
Q

What are the first four steps involved in the construction of a decision table?

A
  1. Identify each decision variable and its allowable values.
  2. Compute the number of decision variable combinations as the product of the number of values of each decision table.
  3. Construct a table with one more column than the number of decision variable combinations computed in step 2.
  4. Assign the decision variable with the fewest values to the first row of the table. Put the decision variable name in the first column. Divide the remaining columns into sets of columns for each decision variable value.