3
CSEN5322 Quiz-5

CSEN5322 Quiz-5. Multiple Choices 1. An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single,

Embed Size (px)

Citation preview

Page 1: CSEN5322 Quiz-5. Multiple Choices 1. An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single,

CSEN5322

Quiz-5

Page 2: CSEN5322 Quiz-5. Multiple Choices 1. An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single,

Multiple Choices1. An instruction that executes atomically ____.

A) must consist of only one machine instructionB) executes as a single, uninterruptible unitC) cannot be used to solve the critical section problemD) All of the above

2. _____ can be used to prevent busy waiting when implementing a semaphore.A) Spinlocks C) Mutex lockB) Waiting queues D) Allowing the wait() operation to succeed

3. Windows XP, when accessing a global variable on a uniprocessor system, ____.A) masks interrupts for all interrupt handlers that may also access the variableB) uses spinlocksC) uses an adaptive mutex schemeD) uses mutex locks

T/F4. Mutex locks and binary semaphores are essentially the same thing.5. If a resource-allocation graph has a cycle, the system must be in a deadlocked state.

Page 3: CSEN5322 Quiz-5. Multiple Choices 1. An instruction that executes atomically ____. A) must consist of only one machine instruction B) executes as a single,

Multiple Choices1. An instruction that executes atomically ____.

A) must consist of only one machine instructionB) executes as a single, uninterruptible unitC) cannot be used to solve the critical section problemD) All of the above

2. _____ can be used to prevent busy waiting when implementing a semaphore.A) Spinlocks C) Mutex lockB) Waiting queues D) Allowing the wait() operation to succeed

3. Windows XP, when accessing a global variable on a uniprocessor system, ____.A) masks interrupts for all interrupt handlers that may also access the variableB) uses spinlocksC) uses an adaptive mutex schemeD) uses mutex locks

T/F4. Mutex locks and binary semaphores are essentially the same thing. T5. If a resource-allocation graph has a cycle, the system must be in a deadlocked state.

F