Quiz on Computation Relations and Models

What is the primary purpose of priority relations in computations?

• To serve as model constraints for execution sequences

• To define exclusive access to resources

• To organize computations within components

• To facilitate message passing

What must be guaranteed when computations involve writing to shared memory?

• Exclusive access to the memory

• Granularity of tasks

• Asynchronous message passing

• Periodic scheduling

Which type of message passing does not require the sender to wait for the recipient?

• Blocking communication

• Extended rendezvous

• Asynchronous message passing

• Synchronous message passing

What is a critical section in the context of shared memory?

• A part of the program that requires exclusive access

• A type of message passing

• A model of computation

• A segment of code that can be executed by multiple threads

In the data-flow model, what triggers the execution of operations?

• The scheduling of tasks

• The completion of previous tasks

• The communication between components

• The availability of data

What is the main characteristic of a finite state machine (FSM)?

• It relies on shared memory for communication

• It can execute multiple tasks concurrently

• It can only be in one state at a time

• It uses differential equations for modeling

What does the term 'granularity' refer to in the context of computations?

• The complexity of graph nodes

• The number of computations performed

• The size of the memory used

• The speed of message passing

Which model is based on the sequential execution of primitive computations?

• Data flow model

• Von Neumann model

• Discrete event model

• Finite state machine model

What is an AND-superstate in State Charts?

• A state that can only be in one substate at a time

• A state that can be in multiple substates simultaneously

• A mechanism for asynchronous communication

• A type of critical section

What does the history mechanism in State Charts allow?

• Creating new states dynamically

• Exiting the current state immediately

• Entering multiple substates at once

• Returning to the last active substate