Question

1.

Suppose a thread opened a file for read.

Group of answer choices

Other threads from another process can also read that file

any other thread cannot read that file

Other threads within the same process can also read that file

any thread within the same process and from another process can also read that file

2.

Mutex and semaphores can implement busy wait using two methods: by disabling interrupts or using special atomic instructions (e.g., test_and_set()). Which method is more convenient to use in a multi-processor system?

Group of answer choices

Any of the two

disable interrupts

special atomic instructions

3.

Race conditions can be avoided via

Group of answer choices

software functions

transactional memory

all of the mentioned

special hardware instructions

4.

Which requirement of the critical section problem, if not met, leads to process starvation?

Group of answer choices

Mutual Exclusion

Progress

All of the mentioned

Bounded Waiting

5

Monitors can implement the wait function on conditional variables

Group of answer choices

via both blocking on waiting queue and busy waiting

only via blocking on waiting queue

only via busy waiting

6.

In a multilevel feedback scheduling algorithm:

Group of answer choices

a process can move to a different classified ready queue

classification of ready queue is permanent

processes are not classified into groups

7.

The Round Robin scheduling algorithm is

Group of answer choices

a non-preemptive scheduler

a preemptive scheduler

none of the mentioned

Answer 1

1. Suppose a thread opened a file for read.

Group of answer choices

Other threads from another process can also read that file (False)

any other thread cannot read that file (False)

Other threads within the same process can also read that file (True)

any thread within the same process and from another process can also read that file (False)

Because a threads with in the same process shares the shared memory.

1. Mutex and semaphores can implement busy wait using two methods: by disabling interrupts or using special atomic instructions (e.g., test_and_set()). Which method is more convenient to use in a multi-processor system?

Group of answer choices

Any of the two

disable interrupts

special atomic instructions (True)

Disabling interrupts is only helpful in uniprocessor systems.

1. Race conditions can be avoided via

Group of answer choices

software functions

transactional memory

all of the mentioned ( True)

special hardware instructions

1. Which requirement of the critical section problem, if not met, leads to process starvation?

Group of answer choices

Mutual Exclusion

Progress

All of the mentioned ( True)

Bounded Waiting

1. Monitors can implement the wait function on conditional variables

Group of answer choices

via both blocking on waiting queue and busy waiting ( True )

only via blocking on waiting queue

only via busy waiting

1. In a multilevel feedback scheduling algorithm:

Group of answer choices

a process can move to a different classified ready queue ( True)

classification of ready queue is permanent  

processes are not classified into groups

1. The Round Robin scheduling algorithm is

Group of answer choices

a non-preemptive scheduler

a preemptive scheduler ( True)

none of the mentioned