Operating System Set 13
On This Page
This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 13
Q1 | Which is the process of invoking the wait
- transaction
- operation
- function
- all of the mentioned
Q2 | Write ahead logging is a way
- to ensure atomicity
- to keep data consistent
- that records data on stable storage
- all of the mentioned
Q3 | The system periodically performs checkpoints that consists of the following operation(s)
- putting all the log records currently in main memory onto stable storage
- putting all modified data residing in main memory onto stable storage
- putting a log record onto stable storage
- all of the mentioned
Q4 | A locking protocol is one that
- governs how locks are acquired
- governs how locks are released
- governs how locks are acquired and released
- none of the mentioned
Q5 | The two phase locking protocol consists of
- growing & shrinking phase
- shrinking & creation phase
- creation & growing phase
- destruction & creation phase
Q6 | The growing phase is a phase in which?
- a transaction may obtain locks, but does not release any
- a transaction may obtain locks, and releases a few or all of them
- a transaction may release locks, but does not obtain any new locks
- a transaction may release locks, and does obtain new locks
Q7 | What is a reusable resource?
- that can be used by one process at a time and is not depleted by that use
- that can be used by more than one process at a time
- that can be shared between various threads
- none of the mentioned
Q8 | Which of the following condition is required for a deadlock to be possible?
- mutual exclusion
- a process may hold allocated resources while awaiting assignment of other resources
- no resource can be forcibly removed from a process holding it
- all of the mentioned
Q9 | Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
- the system can allocate resources to each process in some order and still avoid a deadlock
- there exist a safe sequence
- all of the mentioned
- none of the mentioned
Q10 | The circular wait condition can be prevented by
- defining a linear ordering of resource types
- using thread
- using pipes
- all of the mentioned
Q11 | Which one of the following is the deadlock avoidance algorithm?
- banker’s algorithm
- round-robin algorithm
- elevator algorithm
- karn’s algorithm
Q12 | What is the drawback of banker’s algorithm?
- in advance processes rarely know how much resource they will need
- the number of processes changes as time progresses
- resource once available can disappear
- all of the mentioned
Q13 | For an effective operating system, when to check for deadlock?
- every time a resource request is made
- at fixed time intervals
- every time a resource request is made at fixed time intervals
- none of the mentioned
Q14 | A problem encountered in multitasking when a process is perpetually denied necessary resources is called
- deadlock
- starvation
- inversion
- aging
Q15 | Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
- resource allocation graph
- starvation graph
- inversion graph
- none of the mentioned
Q16 | To avoid deadlock
- there must be a fixed number of resources to allocate
- resource allocation must be done only once
- all deadlocked processes must be aborted
- inversion technique can be used
Q17 | The number of resources requested by a process
- must always be less than the total number of resources available in the system
- must always be equal to the total number of resources available in the system
- must not exceed the total number of resources available in the system
- must exceed the total number of resources available in the system
Q18 | The request and release of resources are
- command line statements
- interrupts
- system calls
- special programs
Q19 | For a deadlock to arise, which of the following conditions must hold simultaneously?
- mutual exclusion
- no preemption
- hold and wait
- all of the mentioned
Q20 | For non sharable resources like a printer, mutual exclusion
- must exist
- must not exist
- may exist
- none of the mentioned
Q21 | The disadvantage of a process being allocated all its resources before beginning its execution is
- low cpu utilization
- low resource utilization
- very high resource utilization
- none of the mentioned
Q22 | 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.
- resources currently available
- processes that have previously been in the system
- resources currently allocated to each process
- future requests and releases of each process
Q23 | A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist.
- resource allocation state
- system storage state
- operating system
- resources
Q24 | A state is safe, if
- the system does not crash due to deadlock occurrence
- the system can allocate resources to each process in some order and still avoid a deadlock
- the state keeps the system protected and safe
- all of the mentioned
Q25 | A system is in a safe state only if there exists a
- safe allocation
- safe resource
- safe sequence
- all of the mentioned