12 Classical Analysis Flashcards

1
Q

Contract between client and developer, specifies product functions and constraints

A

Specifications Document

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

Deadline, ability to run in parallel with current software, response times, reliability, etc

A

Constraints

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

General approach to solving problem

A

Solution Strategy

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

How to analyze customer needs

A

Structured Systems Analysis

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

Logical Data Flow

A

What happens to data, not how

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

Visualization of what happens to data

A

Data Flow Diagram

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

Data Flow Diagram symbols

A

Data source/dest = nested squares, data flow = arrow, transformation = rounded square, data store = open square

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

Structured systems analysis process

A

Draw DFD, decide what to computerize, determine details of data flows, define logic of processes, define data stores, define physical resources, determine I/O specs, sizing, hardware requirements

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

Structured Systems Analysis type?

A

Semiformal

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

FSM

A

Finite State Machine

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

Ways to depict a FSM

A

Tabular, or State-Transition Diagram

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

Parts of a FSM

A

Set of states, set of inputs, transition function, initial state, final states

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

Sizing

A

How much throughput is needed

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

State-Transition Diagram parts

A

States = boxes or squares, events = labeled arrows

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

Petri Net diagram parts

A

Places/states = circles, transitions = lines, I/O = arrows, tokens = dots

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

Petri net rules

A

During transition firing, each departing arrow removes a token, each arriving arrow deposits a token

17
Q

Requires zero tokens to fire

A

Inhibitor arc

18
Q

Constraints

A

Deadline, ability to run in parallel with current software, response times, reliability, etc

19
Q

Solution Strategy

A

General approach to solving problem

20
Q

State-Transition Diagram

A

FSM model

21
Q

How much throughput is needed

A

Sizing