A deadlocked state occurs whenever the system has no available free resources. T
ID: 3572954 • Letter: A
Question
A deadlocked state occurs whenever the system has no available free resources.
True
False
2 points
QUESTION 29
Virtual memory is commonly implemented by demand paging.
True
False
2 points
QUESTION 30
The round-robin algorithm is preemptive.
True
False
2 points
QUESTION 31
Java does not provide a mechanism to coordinate the activities of multiple threads when accessing shared data.
True
False
2 points
QUESTION 32
The use of paging in memory allocation solves the problem of internal fragmentation.
True
False
2 points
QUESTION 33
For a transaction to be executed atomically, all operations associated with a transaction must execute to completion or none are performed.
True
False
2 points
QUESTION 34
Consider the following snapshot of a system: (10pts)
Process Allocation Max Available
A B C D A B C D A B C D
P0 1 2 0 1 1 6 6 2 0 2 2 0
P1 1 0 0 1 1 1 0 1
P2 0 4 4 0 1 4 4 2
P3 0 0 0 2 0 0 2 3
P4 1 0 0 1 3 7 4 4
a) Is the system in a safe state (Use algorithm to show it) ?
b) Is a request from Process P4 arrives for (0, 1, 0, 0) can the request be granted immediately (Use the data to show it) ?
c) Is a request from Process P4 arrives for (0, 0, 1, 0) can the request be granted immediately (Use the data to show it)?
Explanation / Answer
answer 1 > false; because a deadlock occurs when the waiting process is still holding on to another resource that the first needs before it can finish.
answer 29> true; because Virtual memory is commonly implemented by demand paging.
answer 30> true; because Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum. Once a process is executed for a given time period, it is preempted and other process executes for a given
answer 31> false; because Java provides a mechanism to coordinate the activities of multiple threads when accessing shared data. The mechanism that Java uses to support synchronization is the monitor.
answer 32> false; because unlike other types of fragmentation, internal fragmentation is difficult to reclaim; usually the best way to remove it is with a design change. For example, in dynamic memory allocation, memory pools drastically cut internal fragmentation by spreading the space overhead over a larger number of objects.
answer 33> true; because Atomicity is a feature of databases systems dictating where a transaction must be all-or-nothing. That is, the transaction must either fully happen, or not happen at all. It must not complete partially.