650+ Operating System (OS) Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Computer Applications (BCA) , Bachelor of Science in Computer Science (BSc CS) .

Take a Test

301.	Which is the process of invoking the wait
A.	transaction
B.	operation
C.	function
D.	all of the mentioned
Answer» A. transaction

302.	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» D. all of the mentioned

303.	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» D. all of the mentioned

304.	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» C. governs how locks are acquired and released

305.	The two phase locking protocol consists of
A.	growing & shrinking phase
B.	shrinking & creation phase
C.	creation & growing phase
D.	destruction & creation phase
Answer» A. growing & shrinking phase

306.	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» A. a transaction may obtain locks, but does not release any

307.	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» A. that can be used by one process at a time and is not depleted by that use

308.	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» D. all of the mentioned

309.	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» A. the system can allocate resources to each process in some order and still avoid a deadlock

310.	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» A. defining a linear ordering of resource types

311.	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» A. banker’s algorithm

312.	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» D. all of the mentioned

313.	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» C. every time a resource request is made at fixed time intervals

314.	A problem encountered in multitasking when a process is perpetually denied necessary resources is called
A.	deadlock
B.	starvation
C.	inversion
D.	aging
Answer» B. starvation

315.	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» A. resource allocation graph

316.	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» A. there must be a fixed number of resources to allocate

317.	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» C. must not exceed the total number of resources available in the system

318.	The request and release of resources are
A.	command line statements
B.	interrupts
C.	system calls
D.	special programs
Answer» C. system calls

319.	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» D. all of the mentioned

320.	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» A. must exist

321.	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» B. low resource utilization

322.	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» A. resources currently available

323.	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» A. resource allocation state

324.	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» B. the system can allocate resources to each process in some order and still avoid a deadlock

325.	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» C. safe sequence

650+ Operating System (OS) Solved MCQs

Which is the process of invoking the wait

Write ahead logging is a way

The system periodically performs checkpoints that consists of the following operation(s)

A locking protocol is one that

The two phase locking protocol consists of

The growing phase is a phase in which?

What is a reusable resource?

Which of the following condition is required for a deadlock to be possible?

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

The circular wait condition can be prevented by

Which one of the following is the deadlock avoidance algorithm?

What is the drawback of banker’s algorithm?

For an effective operating system, when to check for deadlock?

A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

To avoid deadlock

The number of resources requested by a process

The request and release of resources are

For a deadlock to arise, which of the following conditions must hold simultaneously?

For non sharable resources like a printer, mutual exclusion

The disadvantage of a process being allocated all its resources before beginning its execution is

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 deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist.

A state is safe, if

A system is in a safe state only if there exists a

All unsafe states are

If no cycle exists in the resource allocation graph

The resource allocation graph is not applicable to a resource allocation system

The data structures available in the Banker’s algorithm are

The content of the matrix Need is

The wait-for graph is a deadlock detection algorithm that is applicable when

An edge from process Pi to Pj in a wait for graph indicates that

If the wait for graph contains a cycle

If deadlocks occur frequently, the detection algorithm must be invoked

What is the disadvantage of invoking the detection algorithm for every request?

A deadlock eventually cripples system throughput and will cause the CPU utilization to

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

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 system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock

‘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 deadlock can be broken by

The two ways of aborting processes and eliminating deadlocks are

Those processes should be aborted on occurrence of a deadlock, the termination of which?

The process to be aborted is chosen on the basis of the following factors?

Cost factors for process termination include

If we preempt a resource from a process, the process cannot continue with its normal execution and it must be

To to a safe state, the system needs to keep more information about the states of processes.

If the resources are always preempted from the same process can occur.

What is the solution to starvation?

What is Address Binding?

326.	All unsafe states are
A.	deadlocks
B.	not deadlocks
C.	fatal
D.	none of the mentioned
Answer» B. not deadlocks

327.	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» B. then the system will be in a safe state

328.	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» A. with multiple instances of each resource type

329.	The data structures available in the Banker’s algorithm are
A.	available
B.	need
C.	allocation
D.	all of the mentioned
Answer» D. all of the mentioned

330.	The content of the matrix Need is
A.	allocation – available
B.	max – available
C.	max – allocation
D.	allocation – max
Answer» C. max – allocation

331.	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 instances
D.	all of the mentioned
Answer» A. all resources have a single instance

332.	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» A. pi is waiting for pj to release a resource that pi needs

333.	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» B. then a deadlock exists

334.	If deadlocks occur frequently, the detection algorithm must be invoked
A.	rarely
B.	frequently
C.	rarely & frequently
D.	none of the mentioned
Answer» B. frequently

335.	What is the disadvantage of invoking the detection algorithm for every request?
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» C. considerable overhead in computation time