MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 557 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 351. |
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 instances of each resource type |
| D. | none of the mentioned |
| Answer» B. with a single instance of each resource type | |
| 352. |
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 | |
| 353. |
All unsafe states are |
| A. | deadlocks |
| B. | not deadlocks |
| C. | fatal |
| D. | none of the mentioned |
| Answer» C. fatal | |
| 354. |
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 | |
| 355. |
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 | |
| 356. |
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 | |
| 357. |
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 | |
| 358. |
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 | |
| 359. |
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 | |
| 360. |
The request and release of resources are |
| A. | command line statements |
| B. | interrupts |
| C. | system calls |
| D. | special programs |
| Answer» D. special programs | |
| 361. |
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. | |
| 362. |
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 | |
| 363. |
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 | |
| 364. |
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 | |
| 365. |
What is the drawback of banker’s algorithm? |
| A. | in advance processes rarely know 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. | |
| 366. |
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 | |
| 367. |
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 | |
| 368. |
For an 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 | |
| 369. |
Which of the following condition is required for a 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. | |
| 370. |
What is a 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 | |
| 371. |
The growing phase is a phase in which? |
| A. | a transaction may obtain locks, but does not release any |
| B. | a transaction may obtain locks, and releases a few or all of them |
| C. | a transaction may release locks, but does not obtain any new locks |
| D. | a transaction may release locks, and does obtain new locks |
| Answer» B. a transaction may obtain locks, and releases a few or all of them | |
| 372. |
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? |
| 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 | |
| 373. |
The two phase locking protocol consists of |
| A. | growing & shrinking phase |
| B. | shrinking & creation phase |
| C. | creation & growing phase |
| D. | destruction & creation phase |
| Answer» B. shrinking & creation phase | |
| 374. |
A locking protocol is one that |
| A. | governs how locks are acquired |
| B. | governs how locks are released |
| C. | governs how locks are acquired and released |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 375. |
The system periodically performs checkpoints that consists of the following operation(s) |
| A. | putting all the log records currently in main memory onto stable storage |
| B. | putting all modified data residing in main memory onto stable storage |
| C. | putting a log record onto stable storage |
| D. | all of the mentioned |
| Answer» E. | |
| 376. |
Write ahead logging is a way |
| A. | to ensure atomicity |
| B. | to keep data consistent |
| C. | that records data on stable storage |
| D. | all of the mentioned |
| Answer» E. | |
| 377. |
Which is the process of invoking the wait |
| A. | transaction |
| B. | operation |
| C. | function |
| D. | all of the mentioned |
| Answer» B. operation | |
| 378. |
What are the operations that can be invoked on a condition variable? |
| A. | wait & signal |
| B. | hold & wait |
| C. | signal & hold |
| D. | continue & signal |
| Answer» B. hold & wait | |
| 379. |
A collection of instructions that performs a single logical function is called |
| A. | only one process can be active at a time within the monitor |
| B. | n number of processes can be active at a time within the monitor (n being greater than 1) |
| C. | the queue has only one process in it at a time |
| D. | all of the mentioned |
| Answer» B. n number of processes can be active at a time within the monitor (n being greater than 1) | |
| 380. |
If no process is suspended, the signal operation |
| A. | puts the system into a deadlock state |
| B. | suspends some default process execution |
| C. | nothing happens |
| D. | the output is unpredictable |
| Answer» D. the output is unpredictable | |
| 381. |
A procedure defined within a                  can access only those variables declared locally within the                and its formal parameters. |
| A. | process, semaphore |
| B. | process, monitor |
| C. | semaphore, semaphore |
| D. | monitor, monitor |
| Answer» E. | |
| 382. |
A monitor is characterized by |
| A. | a set of programmer defined operators |
| B. | an identifier |
| C. | the number of variables in it |
| D. | all of the mentioned |
| Answer» B. an identifier | |
| 383. |
A monitor is a type of |
| A. | semaphore |
| B. | low level synchronization construct |
| C. | high level synchronization construct |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 384. |
A deadlock free solution to the dining philosophers problem |
| A. | necessarily eliminates the possibility of starvation |
| B. | does not necessarily eliminate the possibility of starvation |
| C. | eliminates any possibility of any kind of problem further |
| D. | none of the mentioned |
| Answer» C. eliminates any possibility of any kind of problem further | |
| 385. |
The dining – philosophers problem will occur in case of |
| A. | 5 philosophers and 5 chopsticks |
| B. | 4 philosophers and 5 chopsticks |
| C. | 3 philosophers and 5 chopsticks |
| D. | 6 philosophers and 5 chopsticks |
| Answer» B. 4 philosophers and 5 chopsticks | |
| 386. |
To ensure difficulties do not arise in the readers – writers problem                are given exclusive access to the shared object. |
| A. | readers |
| B. | writers |
| C. | readers and writers |
| D. | none of the mentioned |
| Answer» C. readers and writers | |
| 387. |
In the bounded buffer problem, there are the empty and full semaphores that |
| A. | count the number of empty and full buffers |
| B. | count the number of empty and full memory spaces |
| C. | count the number of empty and full queues |
| D. | none of the mentioned |
| Answer» B. count the number of empty and full memory spaces | |
| 388. |
The bounded buffer problem is also known as |
| A. | readers – writers problem |
| B. | dining – philosophers problem |
| C. | producer – consumer problem |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 389. |
Semaphores are mostly used to implement |
| A. | system calls |
| B. | ipc mechanisms |
| C. | system protection |
| D. | none of the mentioned |
| Answer» C. system protection | |
| 390. |
A binary semaphore is a semaphore with integer values |
| A. | 1 |
| B. | -1 c) 0.8 d) 0.5 |
| Answer» B. -1 c) 0.8 d) 0.5 | |
| 391. |
What is a mutex? |
| A. | is a binary mutex |
| B. | must be accessed from only one process |
| C. | can be accessed from multiple processes |
| D. | none of the mentioned |
| Answer» C. can be accessed from multiple processes | |
| 392. |
What are the two kinds of semaphores? |
| A. | mutex & counting |
| B. | binary & counting |
| C. | counting & decimal |
| D. | decimal & binary |
| Answer» C. counting & decimal | |
| 393. |
What is a semaphore? |
| A. | is a binary mutex |
| B. | must be accessed from only one process |
| C. | can be accessed from multiple processes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 394. |
What will happen if a non-recursive mutex is locked more than once? |
| A. | starvation |
| B. | deadlock |
| C. | aging |
| D. | signaling |
| Answer» C. aging | |
| 395. |
The code that changes the value of the semaphore is |
| A. | remainder section code |
| B. | non – critical section code |
| C. | critical section code |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 396. |
If the semaphore value is negative |
| A. | its magnitude is the number of processes waiting on that semaphore |
| B. | it is invalid |
| C. | no operation can be further performed on it until the signal operation is performed on it |
| D. | none of the mentioned |
| Answer» B. it is invalid | |
| 397. |
The signal operation of the semaphore basically works on the basic                system call. |
| A. | continue() |
| B. | wakeup() |
| C. | getup() |
| D. | start() |
| Answer» C. getup() | |
| 398. |
The wait operation of the semaphore basically works on the basic                system call. |
| A. | stop() |
| B. | block() |
| C. | hold() |
| D. | wait() |
| Answer» C. hold() | |
| 399. |
What are the two atomic operations permissible on semaphores? |
| A. | wait |
| B. | stop |
| C. | hold |
| D. | none of the mentioned |
| Answer» B. stop | |
| 400. |
Semaphore is a/an                to solve the critical section problem. |
| A. | hardware for a system |
| B. | special program for a system |
| C. | integer variable |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |