CS2002 - Week 7 - Activity Diagrams Flashcards

(15 cards)

1
Q

Primary focus of an activity diagram

A

Modelling procedural processing

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

Node

A

basic element of activity diagrams, specifys user-defined behaviour (actions, objects, control nodes)

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

Edges

A

connects activites and nodes (actions)

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

Token in activity diagrams

A

A virtual mechanism that:
- grants execution permission to actions (control token)
- transports data (object token)

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

Key control nodes

A

Initial node: Starts activity
Activity final node: Ends all flows
Decision node: Splits paths with guards
Merge node: Combines alternative paths

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

Concurrent paths modeling (Parallelisation vs Synchronisation)

A

Parallelisation node: Splits into concurrent flows
Synchronisation node: Waits for all flows to complete

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

Object node

A

Represents data/objects exchanged between actions

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

Central Buffers vs Data Stores

A

Central Buffer: Transient (deletes tokens after reading)
Data Store: Permanent (copies tokens)

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

Types of event-based actions

A

Send signal: Triggers an event
Accept event: Waits for an event/time

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

Partition

A

Groups nodes by responsibility/roles

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

Types of exception handling

A

Exception handler: Replaces a failed action
Interruptible region: Terminates a group of actions on an event

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

Symbol for call behaviour action

A

Fork icon

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

Token reaches an activity final node

A

All flows terminate immediately (even concurrent ones)

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

Guards in activity diagrams

A

Ensure flows continue only if specific conditions are met
Must be mutually exclusive for decision nodes. (In square brackets: [grade >= 5])

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

Connectors usage

A

To simplify diagrams when actions are far apart (avoid crossing lines)

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