Explore topic-wise MCQs in Software Design.

This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Software Design knowledge and support exam preparation. Choose a topic below to get started.

1.

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» E.
Discussion
2.

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» C. All of the mentioned
Discussion
3.

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» E.
Discussion
4.

What is 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» B. They are several transition arrows connected using point symbols
Discussion
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» E.
Discussion
6.

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» D. None of the mentioned
Discussion
7.

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 immediate exit from each concurrent automaton’s current state
C. All of the mentioned
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
8.

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» D. None of the mentioned
Discussion
9.

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» D. None of the mentioned
Discussion