Block 2 - From analysis to design Flashcards

1
Q

action

A

an atomic momentaneous execution changing the model state;

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

activity

A

a non-atomic durative execution repping a set of actions;

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

aggregate (composite) object

A

where an object is composed of other objects;

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

analysis class

A

reps a solution entity but with no SOs;

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

assertion

A

= {precons, postcons, invariants}

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

association loop invariant

A

reps relation between two paths around a loop;

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

baseline

A

a config-version on which further development can take place;

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

Cascade pattern

A

where objects form a chain of messaging responsibilities;

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

check(ing) in

A

where an edited config-item is returned to the repository;

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

check(ing) out

A

where a config-item is removed from the repository for editing;

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

class diagram

A

a static rep of a domain or SS;

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

class-responsibility-collaboration cards

A

where a card template is used to identify classes:

  • class name = …
  • class responsibilities = …
  • (other) class collaborations = …
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

compiler

A

translates a program from one language to another;

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

concept(tual) model

A

reps the static part of the domain;

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

correctness

A

where a SS meets its spec.;

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

defect

A

where a SS doesn’t meet a requirement(s);

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

defensive programming

A

precons should always be checked;

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

Design by Contract (DbC)

A

assume precons have been checked;

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

design model

A

a static rep of a solution with a class diagram including SOs;

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

domain model

A

an static rep of a domain with a class diagram;

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

dynamic model

A

models behaviour;

22
Q

dynamic tool

A

a tool used at run-time;

23
Q

enumeration type

A

a user-defined symbol alphabet;

24
Q

external event

A

where a user acts on the SS in some way;

25
final state
a solid circle enclosed in an empty circle with only incoming transitions;
26
Fork pattern
where one object assumes all the messaging responsibilities;
27
formal technical review (FTR)
a critique of a SS with a view to improving it;
28
fragment (UML)
encapsulates behaviour inside a labelled (opt / alt / loop) box;
29
General Responsibility Assignment Software Patterns (GRASP)
guidelines on how to assign responsibilities to components;
30
grammatical parse
identifying noun phrases from a domain description to discern candidate classes;
31
GRASP Creator
provides guidance on which class should be responsible for creating new objects;
32
GRASP Expert
provides guidance on which class should be responsible for initialising and state-changing an object;
33
initial state
a solid circle with only one outgoing transition;
34
interaction diagram
= {sequence diagram, communication diagram}
35
interface
the SOs of a component;
36
self-transition
where a state transitions to itself;
37
Law of Demeter
on receipt of message m(p_1,...,p_n), an object O should only send messages the following objects: - O itself; - p_k; - objects that m() tells O to create; - objects O holds a reference to;
38
message numbering
shows chronological order of message-sends in a communication diagram;
39
namespace
a collection within which names are unique;
40
navigability
where 1+ associations / links can be hopped in order to reach an object(s);
41
non-deterministic
where 1+ outcomes is possible;
42
Object Constraint Language (OCL)
[UML + logic + sets] to rep invariants;
43
object diagram
an instance of a class diagram at time t;
44
package
a collection of components and / or other packages;
45
qualified association
where a qualifier is added to the Class_A end of the association but with the qualifier being derived from a Class_B end attribute;
46
recursive association
a relation between a class and itself;
47
role name
where the doer (or doee) of the association is labelled at the relevant end;
48
sequence diagram
reps the message-sends with time flowing downwards;
49
signature
the name, parameters and return type of an SO;
50
state machine
reps the states an object goes through during its life;
51
static analysis tools
tools that test SS at compile time;
52
UC realisation
mapping UCs to their SOs