Software Design Multiple Choice Questions on ” Advanced UML State diagrams”.
1. Which of the following states about concurrent region?
a) It is Concurrent composite states contain two or more concurrent state diagrams separated by dashed lines
b) The concurrent state diagrams specify finite automata that execute in parallel
c) All of the mentioned
d) None of the mentioned
Answer: c
Clarification: The Concurrent region is a concurrent composite states contain two or more concurrent state diagrams separated by dashed lines and specifies finite automata that execute in parallel.
2. Which of the following are the ways to make transitions into and two ways to make transitions from concurrent composite states?
a) A transition is made to the composite state boundary
b) A transition into a concurrent composite state is to make a transition directly to one of its sub-states
c) All of the mentioned
d) None of the mentioned
Answer: c
Clarification: There are two ways to make transitions into and two ways to make transitions from concurrent composite states, a transition is made to the composite state boundary and the second way to make a transition into a concurrent composite state is to make a transition directly to one of its sub-state.
3. Which of the following are the ways to leave concurrent composite states?
a) Transitioning from the composite state and transitioning from individual sub-states
b) A transition from a sub-state to an external state causes the immediate exit from each concurrent automaton’s current state
c) All of the mentioned
d) None of the mentioned
Answer: c
Clarification: There are two ways to leave concurrent composite states – transitioning from the composite state and transitioning from individual sub-states and a transition from a sub-state to an external state causes the immediate exit from each concurrent automaton’s current state.
4. What is a Synch state?
a) It is a counter that keeps track of transitions
b) They are represented in state diagrams by Synch state symbols, which are small circles containing either a positive integer or an asterisk, indicating the counter’s upper bound
c) All of the mentioned
d) None of the mentioned
Answer: c
Clarification: A synch state is a counter that keeps track of transitions and they are represented in state diagrams by synch state symbols, which are small circles containing either a positive integer or an asterisk, indicating the counter’s upper bound.
5. Which of the following is false about Concurrent composite states?
a) Concurrent composite states simplify state diagrams by greatly reducing the number of states and transitions
b) Any set of concurrent state diagrams can be converted into an equivalent sequential state diagram, but the number of states in the sequential state diagram may be as much as the product of the number of states in each of the concurrent state diagrams
c) All of the mentioned
d) None of the mentioned
Answer: d
Clarification: Concurrent composite states simplify state diagrams by greatly reducing the number of states and transitions and Any set of concurrent state diagrams can be converted into an equivalent sequential state diagram, but the number of states in the sequential state diagram may be as much as the product of the number of states in each of the concurrent state diagrams.
6. What is the Transition junction point?
a) The transitions from different sources can converge to a point and transitions leaving the point symbol may disperse to different targets
b) They are several transition arrows connected using point symbols
c) All of the mentioned
d) None of the mentioned
Answer: a
Clarification: The transitions from different sources can converge on a transition junction point symbol and transitions leaving the transition junction, point symbol may disperse to different targets and Several transition arrows connected using transition junction point symbols are compound transitions.
7. Which of the following represents history state?
a) A history state is a pseudo-state that serves as a marker indicating that the sub-state last active when the composite state was exited should be re-entered
b) The history state indicator is a circled H
c) A history state may have a single unlabeled transition arrow emanating from it to one of its peer states
d) All of the mentioned
Answer: d
Clarification: The history state indicator is a circled capital H and rest all are true.
8. Which of the following are the heuristics for the State diagram?
a) Avoid concurrent composite states, especially those with synch states
b) Designate an initial state in every concurrent region of a concurrent composite state
c) Check that transitions to several concurrent sub-states go through a fork
d) All of the mentioned
Answer: d
Clarification: All of the mentioned are the heuristics followed by a state diagram.
9. What does “Designate an initial state in every concurrent region of a concurrent composite state” mean?
a) If there are no transitions to a concurrent composite state’s boundary, then concurrent regions do not need to have initial states
b) A transition to the composite state’s boundary could be added later, though, so initial states for each region should always be specified
c) It is legal to transition directly to more than one sub-state of a concurrent composite state without going through a fork
d) All of the mentioned
Answer: d
Clarification: If there are no transitions to a concurrent composite state’s boundary, then concurrent regions do not need to have initial states and a transition to the composite state’s boundary could be added later, though, so initial states for each region should always be specified.
10. Why there is a need to “Check that transitions to several concurrent sub-states go through a fork”?
a) State diagrams must specify deterministic finite automata, so there can be no doubt which transition to follow under every possible circumstance
b) It is illegal to transition directly to more than one sub-state of a concurrent composite state without going through a fork
c) All of the mentioned
d) None of the mentioned
Answer: b
Clarification: Check that transitions to several concurrent sub-states go through a fork because it is illegal to transition directly to more than one sub-state of a concurrent composite state without going through a fork.