COMPUTER SCIENCE AND ENGINEERING
SOFTWARE ENGINEERING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
decision node
|
|
|
merge node
|
|
|
fork node
|
|
|
join node
|
Detailed explanation-1: -A fork node splits a flow into multiple concurrent flows.
Detailed explanation-2: -A fork node is used to split a single incoming flow into multiple concurrent flows. It is represented as a straight, slightly thicker line in an activity diagram.
Detailed explanation-3: -Forks are used to split an incoming transition into concurrent multiple transitions leading to different target states. Joins are used to merge concurrent multiple transitions into a single transition leading to a single target. They are semantic inverses.
Detailed explanation-4: -A fork node is a control node that splits a flow into multiple concurrent flows. Think of it as starting multiple concurrent tasks. A decision node is a control node that chooses between outgoing flows. Think of it as an if-statement in Java or C#.