edited by
1,288 views
0 votes
0 votes

Match each $\text{UML}$ diagram in $\text{List I}$ to its appropriate description in $\text{List II}$.

$\begin{array}{clcl}  & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{State} & \text{(i)} & \text{Describes how the external entities (people, devices) can}\\&  \text{Diagram}&& \text{interect with the System} \\ \text{(b)} & \text{Use Case} & \text{(ii)} & \text{Used to describe the static or structural view of a system}\\&  \text{Diagram}&& \text{} \\ \text{(c)} & \text{Class} & \text{(iii)} & \text{Used to show the flow of a business process, the steps}\\&  \text{Diagram}&& \text{of a use-case or the logic of an object behaviour} \\ \text{(d)} & \text{Activity} & \text{(iv)} & \text{Used to describe the dynamic behaviour of objects and}\\&  \text{Diagram}&& \text{could also be used to describe the entire system behaviour} \\ \end{array}$

$\textbf{Code :}$

  1. $\text{(a)-(i); (b)-(iv); (c)-(ii); (d)-(iii)}$
  2. $\text{(a)-(iv); (b)-(ii); (c)-(i); (d)-(iii)}$
  3. $\text{(a)-(i); (b)-(iv); (c)-(iii); (d)-(ii)}$
  4. $\text{(a)-(iv); (b)-(i); (c)-(ii); (d)-(iii)}$
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,324 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$