MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 70 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
What are global locks ? |
| A. | they synchronize access to local resources |
| B. | they synchronize access to global resources |
| C. | they synchronize access to local and global resources |
| D. | none of above |
| Answer» C. they synchronize access to local and global resources | |
| 52. |
Deadlock avoidance requires knowledge of future |
| A. | Process |
| B. | Resource |
| C. | Program |
| D. | Application |
| Answer» B. Resource | |
| 53. |
A direct method of deadlock prevention is to prevent the occurrence of ………….. |
| A. | Mutual exclusion |
| B. | Hold and wait |
| C. | Circular waits |
| D. | No preemption |
| Answer» D. No preemption | |
| 54. |
Which of the following is deadlock avoidance algorithm? |
| A. | round-robin algorithm |
| B. | banker's algorithm |
| C. | Multilevel feedback |
| D. | None of the above. |
| Answer» C. Multilevel feedback | |
| 55. |
In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock. |
| A. | Mutual exclusion |
| B. | Hold and Wait |
| C. | Circular Wait |
| D. | No Preemption |
| Answer» D. No Preemption | |
| 56. |
Semaphores function is to |
| A. | synchronize critical resources to prevent deadlock |
| B. | synchronize processes for better CPU utilization |
| C. | used for memory management |
| D. | none of above |
| Answer» B. synchronize processes for better CPU utilization | |
| 57. |
Banker's algorithm for resource allocation deals with ? |
| A. | deadlock prevention |
| B. | deadlock aviodance |
| C. | deadlock recovery |
| D. | circular wait |
| Answer» C. deadlock recovery | |
| 58. |
Situations where two or more processes are reading or writing some shared data and the final results depends on the order of usage of the shared data, are called ________. |
| A. | Race conditions |
| B. | Critical section |
| C. | Mutual exclusion |
| D. | Dead locks |
| Answer» B. Critical section | |
| 59. |
A solution to the Dining Philosophers Problem which avoids deadlock is |
| A. | ensure that all philosophers pick up the left fork before the right fork |
| B. | ensure that all philosophers pick up the right fork before the left fork |
| C. | ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork |
| D. | None of the above |
| Answer» D. None of the above | |
| 60. |
A direct method of deadlock prevention is to prevent the occurrences of ................... |
| A. | Mutual exclusion |
| B. | Hold and wait |
| C. | Circular waits |
| D. | No preemption |
| Answer» D. No preemption | |
| 61. |
Resource locking ________. |
| A. | Allows multiple tasks to simultaneously use resourc |
| B. | Forces only one task to use any resource at any time |
| C. | Can easily cause a dead lock condition |
| D. | Is not used for disk drives |
| Answer» C. Can easily cause a dead lock condition | |
| 62. |
A system has 'm' number of resources of same type and 3 processes A, B, C. Share these resources A, B, C which have the peak demand of 3, 4 and 6 respectively. Deadlock will not occur if the value of 'm' is __________. |
| A. | m = 15 |
| B. | m = 8 |
| C. | m = 13 |
| D. | m = 9 |
| Answer» D. m = 9 | |
| 63. |
Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]);wait (m[(i+1) mode 4]); ......... release (m[i]); release (m[(i+1)mod 4]); This could cause |
| A. | Thrashing |
| B. | Deadlock |
| C. | Starvation, but not deadlock |
| D. | None of the above |
| Answer» C. Starvation, but not deadlock | |
| 64. |
A useful tool in characterizing and allocating of resources to process is the |
| A. | User Allocation Graph |
| B. | Time Allocation Graph |
| C. | Resource Allocation Graph |
| D. | Location Allocation Graph |
| Answer» D. Location Allocation Graph | |
| 65. |
……………. can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other. |
| A. | Deadlock |
| B. | Permanent lock |
| C. | Starvation |
| D. | Mutual exclusion |
| Answer» B. Permanent lock | |
| 66. |
With a single resource, deadlock occurs |
| A. | if there are more than two processes competing for that resource |
| B. | if there are only two processes competing for that resource |
| C. | if there is a single process competing for that resource |
| D. | none of these |
| Answer» E. | |
| 67. |
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is |
| A. | 11 |
| B. | 12 |
| C. | 13 |
| D. | 14 |
| Answer» B. 12 | |
| 68. |
'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up |
| A. | deadlock can never occur |
| B. | deadlock may occur |
| C. | deadlock has to occur |
| D. | none of these |
| Answer» B. deadlock may occur | |
| 69. |
The methods for dealing with the deadlock problem is |
| A. | Use a protocol to make sure that the system never enters in to the deadlock state. |
| B. | Allow the system to enter a deadlock state and then recover. |
| C. | Ignore the problem, and pretend that deadlocks never occur in the system. The UNIX operating system uses this solution. |
| D. | all of these |
| Answer» E. | |
| 70. |
With deadlock detection, requested resources are granted to |
| A. | Resources |
| B. | Programs |
| C. | Processes |
| D. | Users |
| Answer» D. Users | |