Multiplas summer 2022

Question 1

CSMA/CA guarantees predictable response times to all bus participants

Answer 1

False

Question 2

CSMA/CA is used in wireless networks to reduce the chances of packet collision, it does not guarantee predictable response times

Answer 2

True

Question 3

A net N = (C, E, F) is called pure, if the flow relation F does not contain any loops

Answer 3

True

Question 4

Pure nets does not have nay traps or loops

Answer 4

true

Question 5

EDF (Earliest Deadline First) is optimal for periodic scheduling

Answer 5

True

Question 6

EDF (Earliest Deadline First) is optimal for tasks that are periodic and independent, it can schedule any set of tasks as long as the total CPU utilization is less than or equal to 1

Answer 6

True

Question 7

Rate-Monotonic scheduling is not based on static properties.

Answer 7

Wrong

Question 8

Rate-Monotonic scheduling is based on static properties, task priority is assigned based on the task’s period, the shorter the task, the higher the priority

Answer 8

True

Question 9

Any specification language has to have a notion of hierarchy

Answer 9

False

Question 10

It is not mandatory property of all specification languages to have a notion of hierarchy

Answer 10

True

Question 11

Scratchpad memories are typcically more energy-efficient than caches.

Answer 11

True

Question 12

SPM’s (Scratchpad Memories) are simple. Compiller-managed RAM without the HW overhead of caches

Answer 12

True

Question 13

The priority ceiling protocol guarantees that, once a task has entered a critical section, it must be blocked by
lower-priority tasks until its completion

Answer 13

False

Question 14

PCP ( priority ceiling protocol ) ensures that a higher-priority task will not be blocked by a lower-priority task

Answer 14

True

Question 15

Condition/Event nets (C/E-Nets) can have tokens of different colors (???? see better)

Answer 15

False (????)

Question 16

A Pareto-set contains all Pareto-optimal solutions.

Answer 16

True

Question 17

Kahn process networks are determinate.

Answer 17

True

Question 18

Kahn process networks are determinate in the sense that for a given input, they will always produce the same output, regardless of the execution timing or ordering of processes

Answer 18

True