Professional Documents
Culture Documents
LOGIN HELP
UML Quiz
Quiz Score
You have solved Activity diagram with 29 Questions.
6.90% Questions were answered correct.
Get some feedback by viewing each Question.
initial node
A is activated as soon as all incoming edges have tokens. This can never
happen. It is likely that the modeler tried to model a loop. This could be done
as follows:
elearning.uml.ac.at/submitQuiz 1/11
about:blank 1/11
7/21/23, 12:26 AM Activity - Lecture notes 5
The decision node (diamond) is a control node that passes the control flow
to one of several outputs depending on the evaluation of the guard
conditions. The token is passed to either B or C. The join node can only
synchronise the incoming flows as soon as all previous executions (here: B
and C) are completed. This can never happen.
Object nodes can be used as input and output nodes for activities.
B → C
elearning.uml.ac.at/submitQuiz 2/11
about:blank 2/11
7/21/23, 12:26 AM Activity - Lecture notes 5
A → C
C can only be executed as soon as A and B are finished.
A → B → C
B → A → C
A → C
A → B → C
Either B or C are executed.
A → C → B
Either B or C are executed.
A → B
A → B → D
A → B → C
A → D
A → B → C → D
After the execution of C is completed, the control flow reaches an activity
final node which terminates all activity within the graph. D cannot be
executed.
A → B → D → C
After the execution of D is completed, the control flow reaches an activity
final node which terminates all activity within the graph.
elearning.uml.ac.at/submitQuiz 3/11
about:blank 3/11
7/21/23, 12:26 AM Activity - Lecture notes 5
A → B → C
A → B
After the successful execution of B, the control flow continues regularly, thus
C is executed.
A → C
A → C
A → B
C has to be executed to reach the activity final node that terminates the
whole graph.
A → C → B
After the execution of C is completed, the control flow reaches an activity
final node which terminates all activity within the graph. B cannot be
executed.
B
A and C have to be executed to reach the activity final node that terminates
the whole graph.
A → B → C
Question 11: You are given the following activity diagram. Which
of the following action sequences are possible during one
elearning.uml.ac.at/submitQuiz 4/11
about:blank 4/11
7/21/23, 12:26 AM Activity - Lecture notes 5
A → B → D → C
After the completion of D the whole graph is terminated, C cannot be
executed.
A → B → D
A → C
A → B → C
If event B occurs while A is executed, all activity in the region (within the
pointed rectangle) is terminated and control is transfered to the interrupt
handler activity node (D).
Question 12: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → B → C → D
A → B → D → C
A → C
B and D also have to be executed before the flow is synchronised and
reaches the final node.
A → C → B → D
A → B → D
C also has to be executed before the flow is synchronised and reaches the
final node.
elearning.uml.ac.at/submitQuiz 5/11
about:blank 5/11
7/21/23, 12:26 AM Activity - Lecture notes 5
Question 14: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → D
A → B → D
A → B → C
The flow final node after C only terminates this thread, D also has to be
completed to reach the activity final node and terminate the whole graph.
A → B → C → D
A → B → D → C
After the execution of D is completed, the control flow reaches an activity
final node which terminates all activity within the graph. C cannot be
executed.
Question 15: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → C → B
A → B → C
A → B
After the execution of B, the execution of this one branch is terminated, but
the execution of the other branch can go on. Thus C has to be executed
ensuring that the second flow final node is reached and the graph is
terminated.
A → C
After the execution of C, the execution of this one branch is terminated, but
the execution of the other branch can go on. Thus B has to be executed
ensuring that the second flow final node is reached and the graph is
terminated.
... specifies the direction of the control flow with guard conditions.
elearning.uml.ac.at/submitQuiz 6/11
about:blank 6/11
7/21/23, 12:26 AM Activity - Lecture notes 5
object node
communication node
action node
... unites tokens as soon as they are available on all incoming edges.
... is noted as a black bar with multiple incoming edges and one outgoing
edge.
... synchronizes multiple alternative flows.
A join node synchronizes multiple parallel flows. A merge node "unbranches"
two or more concurrent control paths.
Question 20: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → C
elearning.uml.ac.at/submitQuiz 7/11
about:blank 7/11
7/21/23, 12:26 AM Activity - Lecture notes 5
A → B
A → C → B
After the execution of C is completed, the control flow reaches the activity
final node which terminates all activity within the graph. B cannot be
executed.
A → B → C
After the execution of B is completed, the control flow reaches an activity
final node which terminates all activity within the graph. C cannot be
executed.
join node
distribution node
communication node
knife node
decision node
elearning.uml.ac.at/submitQuiz 8/11
about:blank 8/11
7/21/23, 12:26 AM Activity - Lecture notes 5
Question 24: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → B → C → D
A → B → D
C also has to be executed.
A → B → C
D also has to be executed.
A → D → B → C
B alsways has to be executed before C.
A → D → C
B alsways has to be executed before C.
A → B → D → C
A → D
B and C also have to be executed.
fork node
join node
merge node
decision node
elearning.uml.ac.at/submitQuiz 9/11
about:blank 9/11
7/21/23, 12:26 AM Activity - Lecture notes 5
... is atomic.
Activities are not atomic, actions are atomic.
Question 28: You are given the following activity diagram. Which
of the following action sequences are possible during one
execution of the activity diagram?
A → B → C
A → B → D → C
After the execution of D is completed, the control flow reaches the activity
final node which terminates all activity within the graph. C cannot be
executed.
A → B → D
A → B → C → D
After the execution of C is completed, the control flow reaches the activity
final node which terminates all activity within the graph. D cannot be
executed.
A → D
elearning.uml.ac.at/submitQuiz 10/11
about:blank 10/11
7/21/23, 12:26 AM Activity - Lecture notes 5
about:blank 11/11