Models of Memory Consistency Multiple Choice Questions with Answers – PDF Download

MCQ 1: The conservative memory model that does not allow any instruction reordering on each core, is called:

1. sequential consistency
2. random consistency
3. remote node
4. host node

MCQ 2: One that programming model which allows for having a more efficient implementation, is to suppose that programs are:

1. remote
2. synchronized
3. atomic
4. shared

MCQ 3: The addressing mode which is set to index arrays is applied to indexed addressing mode, in computers is:

1. register addressing mode
2. immediate addressing mode
3. scaled addressing mode
4. register indirect addressing mode

MCQ 4: The average arrival rate of new tasks and the average time to perform a task is:

1. mean number of tasks in system = arrival rate / mean response time
2. mean number of tasks in system = arrival rate + mean response time
3. mean number of tasks in system = arrival rate - mean response time
4. mean number of tasks in system = arrival rate * mean response time