Request edit access
System Modelling 2019/1 -- Theoretical Questions 6
1. Abstraction ...
1/a ... always starts from a model, and its result is the real system. *
1 point
1/b ... always omits some information from the model. *
1 point
1/c ... always results in a model that is a valid model of less real systems than before. *
1 point
1/d ... is the opposite of refinement. *
1 point
2. The diagram that presents a modell …
2/a ... can be replaced by textual description in many cases. *
1 point
2/b ... always contains the same amount of information as the model itself. *
1 point
2/c ... is equal to the modelled system. *
1 point
2/d ... always shows a behavioural model. *
1 point
3. The instance graph …
3/a ... is used to describe the relations among the elements making up the system. *
1 point
3/b … consists of type nodes and type edges. *
1 point
3/c … consists of containment relations and type-instance relations. *
1 point
3/d … can be filtered (abstracted) by the labels of its elements, and the result will be another graph model. *
1 point
4. A model decomposition is …
4/a … correct, only if each element of the original model corresponds to exactly one element after the decomposition. *
1 point
4/b … correct, only if each element after the decomposition corresponds to at least one element of the original model. *
1 point
4/c … a logical one, only if we decompose the system by its distinct pieces. *
1 point
4/d … always breaking up a problem or system to smaller parts. *
1 point
5. A simple state machine (not a statechart) that is a valid model of a system's behaviour …
5/a … is always deterministic. *
1 point
5/b … can change its states only upon external events. *
1 point
5/c … has always to give an output when changing its state. *
1 point
5/d … contains exactly one current (active) state at any time. *
1 point
6. Process modelling …
6/a … usually focuses on modelling the activities executed in the system and the dependecies among them. *
1 point
6/b … always breaks up the system along its physical components, when we define subprocesses in the model. *
1 point
6/c … considers the execution of elementary activities to be always instantaneous. *
1 point
6/d … gives a correct model only if each activity of the model is executed in each run of the process. *
1 point
7. The complete process model describing the behaviour of a real system …
7/a … is always well structured. *
1 point
7/c … always contains a flow begin (start) node. *
1 point
7/d … must only contain nodes that have exactly one outgoing control edge. *
1 point
8. If in a process modell, a fork node is succeeded by activity A on one branch and by activity B on the other branch, then …
8/a … activities A and B will start at the same time. *
1 point
8/b … exactly one activity (either A or B) will be executed. *
1 point
8/c … activity B must start before activity A finishes. *
1 point
8/d … activity B may finish before activity A starts. *
1 point
Submit
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service