MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 1451. |
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be : |
| A. | aborted |
| B. | rolled back |
| C. | terminated |
| D. | queued |
| Answer» C. terminated | |
| 1452. |
Cost factors of process termination include : |
| A. | Number of resources the deadlock process is not holding |
| B. | CPU utilization at the time of deadlock |
| C. | Amount of time a deadlocked process has thus far consumed during its execution |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 1453. |
The process to be aborted is chosen on the basis of the following factors : |
| A. | priority of the process |
| B. | process is interactive or batch |
| C. | how long the process has computed |
| D. | all of the mentioned |
| Answer» E. | |
| 1454. |
Those processes should be aborted on occurrence of a deadlock, the termination of which : |
| A. | is more time consuming |
| B. | incurs minimum cost |
| C. | safety is not hampered |
| D. | all of the mentioned |
| Answer» C. safety is not hampered | |
| 1455. |
The two ways of aborting processes and eliminating deadlocks are : |
| A. | Abort all deadlocked processes |
| B. | Abort all processes |
| C. | Abort one process at a time until the deadlock cycle is eliminated |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 1456. |
A deadlock can be broken by : |
| A. | abort one or more processes to break the circular wait |
| B. | abort all the process in the system |
| C. | preempt all resources from all processes |
| D. | none of the mentioned |
| Answer» B. abort all the process in the system | |
| 1457. |
‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock : |
| A. | can never occur |
| B. | may occur |
| C. | has to occur |
| D. | none of the mentioned |
| Answer» B. may occur | |
| 1458. |
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock : |
| A. | can never occur |
| B. | may occur |
| C. | has to occur |
| D. | none of the mentioned |
| Answer» B. may occur | |
| 1459. |
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is : |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 1 |
| Answer» B. 3 | |
| 1460. |
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify : |
| A. | the set of processes that have been deadlocked |
| B. | the set of processes in the deadlock queue |
| C. | the specific process that caused the deadlock |
| D. | all of the mentioned |
| Answer» B. the set of processes in the deadlock queue | |
| 1461. |
A deadlock eventually cripples system throughput and will cause the CPU utilization to ______ |
| A. | increase |
| B. | drop |
| C. | stay still |
| D. | none of the mentioned |
| Answer» C. stay still | |
| 1462. |
The disadvantage of invoking the detection algorithm for every request is : |
| A. | overhead of the detection algorithm due to consumption of memory |
| B. | excessive time consumed in the request to be allocated memory |
| C. | considerable overhead in computation time |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 1463. |
If deadlocks occur frequently, the detection algorithm must be invoked ________ |
| A. | rarely |
| B. | frequently |
| C. | rarely & frequently |
| D. | none of the mentioned |
| Answer» C. rarely & frequently | |
| 1464. |
If the wait for graph contains a cycle : |
| A. | then a deadlock does not exist |
| B. | then a deadlock exists |
| C. | then the system is in a safe state |
| D. | either deadlock exists or system is in a safe state |
| Answer» C. then the system is in a safe state | |
| 1465. |
An edge from process Pi to Pj in a wait for graph indicates that : |
| A. | Pi is waiting for Pj to release a resource that Pi needs |
| B. | Pj is waiting for Pi to release a resource that Pj needs |
| C. | Pi is waiting for Pj to leave the system |
| D. | Pj is waiting for Pi to leave the system |
| Answer» B. Pj is waiting for Pi to release a resource that Pj needs | |
| 1466. |
The wait-for graph is a deadlock detection algorithm that is applicable when : |
| A. | all resources have a single instance |
| B. | all resources have multiple instances |
| C. | all resources have a single 7 multiple instance |
| D. | all of the mentioned |
| Answer» B. all resources have multiple instances | |
| 1467. |
The content of the matrix Need is : |
| A. | Allocation – Available |
| B. | Max – Available |
| C. | Max – Allocation |
| D. | Allocation – Max |
| Answer» D. Allocation – Max | |
| 1468. |
The data structures available in the Banker’s algorithm are : |
| A. | Available |
| B. | Need |
| C. | Allocation |
| D. | All of the mentioned |
| Answer» E. | |
| 1469. |
The Banker’s algorithm is _____________ than the resource allocation graph algorithm. |
| A. | less efficient |
| B. | more efficient |
| C. | equal |
| D. | none of the mentioned |
| Answer» B. more efficient | |
| 1470. |
The resource allocation graph is not applicable to a resource allocation system : |
| A. | with multiple instances of each resource type |
| B. | with a single instance of each resource type |
| C. | single & multiple instance of each resource type |
| D. | none of the mentioned |
| Answer» B. with a single instance of each resource type | |
| 1471. |
If no cycle exists in the resource allocation graph : |
| A. | then the system will not be in a safe state |
| B. | then the system will be in a safe state |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 1472. |
All unsafe states are : |
| A. | deadlocks |
| B. | not deadlocks |
| C. | fatal |
| D. | none of the mentioned |
| Answer» C. fatal | |
| 1473. |
A system is in a safe state only if there exists a : |
| A. | safe allocation |
| B. | safe resource |
| C. | safe sequence |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 1474. |
A state is safe, if : |
| A. | the system does not crash due to deadlock occurrence |
| B. | the system can allocate resources to each process in some order and still avoid a deadlock |
| C. | the state keeps the system protected and safe |
| D. | all of the mentioned |
| Answer» C. the state keeps the system protected and safe | |
| 1475. |
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist. |
| A. | resource allocation state |
| B. | system storage state |
| C. | operating system |
| D. | resources |
| Answer» B. system storage state | |
| 1476. |
Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state. |
| A. | minimum |
| B. | average |
| C. | maximum |
| D. | approximate |
| Answer» D. approximate | |
| 1477. |
Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock. |
| A. | resources currently available |
| B. | processes that have previously been in the system |
| C. | resources currently allocated to each process |
| D. | future requests and releases of each process |
| Answer» B. processes that have previously been in the system | |
| 1478. |
One way to ensure that the circular wait condition never holds is to : |
| A. | impose a total ordering of all resource types and to determine whether one precedes another in the ordering |
| B. | to never let a process acquire resources that are held by other processes |
| C. | to let a process wait for only one resource at a time |
| D. | all of the mentioned |
| Answer» B. to never let a process acquire resources that are held by other processes | |
| 1479. |
To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it : |
| A. | then the process waits for the resources be allocated to it |
| B. | the process keeps sending requests until the resource is allocated to it |
| C. | the process resumes execution without the resource being allocated to it |
| D. | then all resources currently being held are preempted |
| Answer» E. | |
| 1480. |
The disadvantage of a process being allocated all its resources before beginning its execution is : |
| A. | Low CPU utilization |
| B. | Low resource utilization |
| C. | Very high resource utilization |
| D. | None of the mentioned |
| Answer» C. Very high resource utilization | |
| 1481. |
To ensure that the hold and wait condition never occurs in the system, it must be ensured that : |
| A. | whenever a resource is requested by a process, it is not holding any other resources |
| B. | each process must request and be allocated all its resources before it begins its execution |
| C. | a process can request resources only when it has none |
| D. | all of the mentioned |
| Answer» E. | |
| 1482. |
For sharable resources, mutual exclusion : |
| A. | is required |
| B. | is not required |
| C. | may be or may not be required |
| D. | none of the mentioned |
| Answer» C. may be or may not be required | |
| 1483. |
For non sharable resources like a printer, mutual exclusion : |
| A. | must exist |
| B. | must not exist |
| C. | may exist |
| D. | none of the mentioned |
| Answer» B. must not exist | |
| 1484. |
Deadlock prevention is a set of methods : |
| A. | to ensure that at least one of the necessary conditions cannot hold |
| B. | to ensure that all of the necessary conditions do not hold |
| C. | to decide if the requested resources for a process have to be given or not |
| D. | to recover from a deadlock |
| Answer» B. to ensure that all of the necessary conditions do not hold | |
| 1485. |
For a Hold and wait condition to prevail : |
| A. | A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it |
| B. | A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes |
| C. | A process must hold at least one resource and not be waiting to acquire additional resources |
| D. | None of the mentioned |
| Answer» C. A process must hold at least one resource and not be waiting to acquire additional resources | |
| 1486. |
For Mutual exclusion to prevail in the system : |
| A. | at least one resource must be held in a non sharable mode |
| B. | the processor must be a uniprocessor rather than a multiprocessor |
| C. | there must be at least one resource in a sharable mode |
| D. | all of the mentioned |
| Answer» B. the processor must be a uniprocessor rather than a multiprocessor | |
| 1487. |
For a deadlock to arise, which of the following conditions must hold simultaneously ? |
| A. | Mutual exclusion |
| B. | No preemption |
| C. | Hold and wait |
| D. | All of the mentioned |
| Answer» E. | |
| 1488. |
Multithreaded programs are : |
| A. | lesser prone to deadlocks |
| B. | more prone to deadlocks |
| C. | not at all prone to deadlocks |
| D. | none of the mentioned |
| Answer» C. not at all prone to deadlocks | |
| 1489. |
The request and release of resources are ___________ |
| A. | command line statements |
| B. | interrupts |
| C. | system calls |
| D. | special programs |
| Answer» D. special programs | |
| 1490. |
The number of resources requested by a process : |
| A. | must always be less than the total number of resources available in the system |
| B. | must always be equal to the total number of resources available in the system |
| C. | must not exceed the total number of resources available in the system |
| D. | must exceed the total number of resources available in the system |
| Answer» D. must exceed the total number of resources available in the system | |
| 1491. |
To avoid deadlock |
| A. | there must be a fixed number of resources to allocate |
| B. | resource allocation must be done only once |
| C. | all deadlocked processes must be aborted |
| D. | inversion technique can be used |
| Answer» B. resource allocation must be done only once | |
| 1492. |
Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence? |
| A. | resource allocation graph |
| B. | starvation graph |
| C. | inversion graph |
| D. | none of the mentioned |
| Answer» B. starvation graph | |
| 1493. |
A problem encountered in multitasking when a process is perpetually denied necessary resources is called |
| A. | deadlock |
| B. | starvation |
| C. | inversion |
| D. | aging |
| Answer» C. inversion | |
| 1494. |
For effective operating system, when to check for deadlock? |
| A. | every time a resource request is made |
| B. | at fixed time intervals |
| C. | every time a resource request is made at fixed time intervals |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1495. |
What is the drawback of banker’s algorithm? |
| A. | in advance processes rarely know that how much resource they will need |
| B. | the number of processes changes as time progresses |
| C. | resource once available can disappear |
| D. | all of the mentioned |
| Answer» E. | |
| 1496. |
Which one of the following is the deadlock avoidance algorithm? |
| A. | banker’s algorithm |
| B. | round-robin algorithm |
| C. | elevator algorithm |
| D. | karn’s algorithm |
| Answer» B. round-robin algorithm | |
| 1497. |
The circular wait condition can be prevented by |
| A. | defining a linear ordering of resource types |
| B. | using thread |
| C. | using pipes |
| D. | all of the mentioned |
| Answer» B. using thread | |
| 1498. |
A system is in the safe state if |
| A. | the system can allocate resources to each process in some order and still avoid a deadlock |
| B. | there exist a safe sequence |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. there exist a safe sequence | |
| 1499. |
Which of the following condition is required for deadlock to be possible? |
| A. | mutual exclusion |
| B. | a process may hold allocated resources while awaiting assignment of other resources |
| C. | no resource can be forcibly removed from a process holding it |
| D. | all of the mentioned |
| Answer» E. | |
| 1500. |
What is the reusable resource? |
| A. | that can be used by one process at a time and is not depleted by that use |
| B. | that can be used by more than one process at a time |
| C. | that can be shared between various threads |
| D. | none of the mentioned |
| Answer» B. that can be used by more than one process at a time | |