Operating System Questions & d) all of the mentioned

View Answer
Answers – Basics
Answer:d
This section of our 1000+ Operating System MCQs Explanation:None.
focuses on basic overview of Operating System.
5. The main function of the command interpreter is
1.What is operating system? a) to get and execute the next user-specified
a) collection of programs that manages hardware command
resources b) to provide the interface between the API and
b) system service provider to the application application program
programs c) to handle the files in operating system
c) link to interface the hardware and application d) none of the mentioned
programs View Answer
d) all of the mentioned
View Answer Answer:a
Explanation:None.
Answer:d
Explanation:None. 6. By operating system, the resource management
can be done via
2. To access the services of operating system, the a) time division multiplexing
interface is provided by the b) space division multiplexing
a) system calls c) both (a) and (b)
b) API d) none of the mentioned
c) library View Answer
d) assembly instructions
View Answer Answer:c
Explanation:None.
Answer:a
Explanation:None. 7. If a process fails, most operating system write the
error information to a
3. Which one of the following is not true? a) log file
a) kernel is the program that constitutes the central b) another running process
core of the operating system c) new file
b) kernel is the first part of operating system to load d) none of the mentioned
into memory during booting View Answer
c) kernel is made of various modules which can not
be loaded in running operating system Answer:a
d) kernel remains in the memory during the entire Explanation:None.
computer session
View Answer 8. Which facility dynamically adds probes to a
running system, both in user processes and in the
Answer:c kernel?
Explanation:None. a) DTrace
b) DLocate
4. Which one of the following error will be handle by c) DMap
the operating system? d) DAdd
a) power failure View Answer
b) lack of paper in printer
c) connection failure in the network Answer:a
Explanation:None.
9. Which one of the following is not a real time 3. In Unix, Which system call creates the new
operating system? process?
a) VxWorks a) fork
b) Windows CE b) create
c) RTLinux c) new
d) Palm OS d) none of the mentioned
View Answer View Answer

Answer:d Answer:a
Explanation:None. Explanation:None.

10. The OS X has 4. A process can be terminated due to

a) monolithic kernel a) normal exit
b) hybrid kernel b) fatal error
c) microkernel c) killed by another process
d) monolithic kernel with modules d) all of the mentioned
View Answer View Answer

Answer:b Answer:d
Explanation:None. Explanation:None.

5. What is the ready state of a process?

Operating System Questions & a) when process is scheduled to run after some
Answers – Processes execution
b) when process is unable to run until some task
This section of our 1000+ Operating System MCQs has been completed
focuses on processes in Operating System. c) when process is using the CPU
d) none of the mentioned
1. The systems which allows only one process View Answer
execution at a time, are called
a) uniprogramming systems Answer:a
b) uniprocessing systems Explanation:When process is unable to run until
c) unitasking systems some task has been completed, the process is in
d) none of the mentioned blocked state and if process is using the CPU, it is in
View Answer running state.

Answer:a 6. What is interprocess communication?

Explanation:Those systems which allows more than a) communication within the process
one process execution at a time, are called b) communication between two process
multiprogramming systems. Uniprocessing means c) communication between two threads of same
only one processor. process
d) none of the mentioned
2. In operating system, each process has its own View Answer
a) address space and global variables
b) open files Answer:b
c) pending alarms, signals and signal handlers Explanation:None.
d) all of the mentioned
View Answer 7. A set of processes is deadlock if
a) each process is blocked and will remain so
Answer:d forever
Explanation:None. b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned g) I/O status information
View Answer h) bootstrap program
View Answer
Answer:a
Explanation:None. Answer: h
Explanation: None.
8. A process stack does not contain
a) function parameters 2) The number of processes completed per unit time
b) local variables is known as __________.
c) return addresses a) Output
d) PID of child process b) Throughput
View Answer c) Efficiency
d) Capacity
Answer:d View Answer
Explanation:None.
Answer: b
9. Which system call returns the process identifier of Explanation: None.
a terminated child?
a) wait 3) The state of a process is defined by :
b) exit a) the final activity of the process
c) fork b) the activity just executed by the process
d) get c) the activity to next be executed by the process
View Answer d) the current activity of the process
View Answer
Answer:a
Explanation:None. Answer: d
Explanation: None.
10. The address of the next instruction to be
executed by the current process is provided by the 4) Which of the following is not the state of a
a) CPU registers process ?
b) program counter a) New
c) process stack b) Old
d) pipe c) Waiting
View Answer d) Running
e) Ready
Answer:b f) Terminated
Explanation:None. View Answer

Answer: b
Operating System Questions and Explanation: None.
Answers – Process Control Block
5) The Process Control Block is :
This set of 1000+ Operating System MCQs focuses a) Process type variable
on “Process Control Block” b) Data Structure
c) a secondary storage section
1) A Process Control Block(PCB) does not contain d) a Block in memory
which of the following : View Answer
a) Code
b) Stack Answer: b
c) Heap Explanation: None.
d) Data
e) Program Counter 6) The entry of all the PCBs of the current
f) Process State processes is in :
a) Process Register a) Job Queue
b) Program Counter b) PCB queue
c) Process Table c) Device Queue
d) Process Unit d) Ready Queue
View Answer View Answer

Answer: c Answer: b
Explanation: None. Explanation: None.

7) The degree of multi-programming is : 2) When the process issues an I/O request :

a) the number of processes executed per unit time a) It is placed in an I/O queue
b) the number of processes in the ready queue b) It is placed in a waiting queue
c) the number of processes in the I/O queue c) It is placed in the ready queue
d) the number of processes in memory d) It is placed in the Job queue
View Answer View Answer

Answer: d Answer: a
Explanation: None. Explanation: None.

8) A single thread of control allows the process to 3) When a process terminates : (Choose Two)
perform : a) It is removed from all queues
a) only one task at a time b) It is removed from all, but the job queue
b) multiple tasks at a time c) Its process control block is de-allocated
c) All of these d) Its process control block is never de-allocated
View Answer View Answer

Answer: a Answer: a and c

Explanation: None. Explanation: None.

9) The objective of multi-programming is to : 4) What is a long-term scheduler ?

(choose two) a) It selects which process has to be brought into
a) Have some process running at all times the ready queue
b) Have multiple programs waiting in a queue ready b) It selects which process has to be executed next
to run and allocates CPU
c) To minimize CPU utilization c) It selects which process to remove from memory
d) To maximize CPU utilization by swapping
View Answer d) None of these
View Answer
Answer: a and d
Explanation: None. Answer: a
Explanation: None.

5) If all processes I/O bound, the ready queue will

almost always be ______, and the Short term
Operating System Questions and Scheduler will have a ______ to do.
Answers – Process Scheduling a) full,little
Queues b) full,lot
c) empty,little
This set of 1000+ Operating System Questions and d) empty,lot
Answers focuses on “Process Scheduling Queues” View Answer

1) Which of the following do not belong to queues Answer: c

for processes ? Explanation: None.
6) What is a medium-term scheduler ? b) Ready state
a) It selects which process has to be brought into c) Suspended state
the ready queue d) Terminated state
b) It selects which process has to be executed next View Answer
and allocates CPU
c) It selects which process to remove from memory Answer: b
by swapping Explanation: None.
d) None of these 11) In a multi-programming environment :
View Answer a) the processor executes more than one process at
Answer: c a time
Explanation: None. b) the programs are developed by more than one
person
7) What is a short-term scheduler ? c) more than one process resides in the memory
a) It selects which process has to be brought into d) a single user can execute many programs at the
the ready queue same time
b) It selects which process has to be executed next View Answer
and allocates CPU
c) It selects which process to remove from memory Answer: c
by swapping Explanation: None.
d) None of these 12) Suppose that a process is in “Blocked” state
View Answer waiting for some I/O service. When the service is
Answer: b completed, it goes to the :
Explanation: None. a) Running state
b) Ready state
8) The primary distinction between the short term c) Suspended state
scheduler and the long term scheduler is : d) Terminated state
a) The length of their queues View Answer
b) The type of processes they schedule
c) The frequency of their execution Answer: b
d) None of these Explanation: None.
View Answer 13) The context of a process in the PCB of a
Answer: c process does not contain :
Explanation: None. a) the value of the CPU registers
b) the process state
9) The only state transition that is initiated by the c) memory-management information
user process itself is : d) context switch time
a) block View Answer
b) wakeup
c) dispatch Answer: d
d) None of these Explanation: None.
View Answer 14) Which of the following need not necessarily be
Answer: a saved on a context switch between processes ?
Explanation: None. (GATE CS 2000)
a) General purpose registers
10) In a time-sharing operating system, when the b) Translation look-aside buffer
time slot given to a process is completed, the c) Program counter
process goes from the running state to the : d) All of these
a) Blocked state View Answer
Answer: b d) init process
Explanation: None. View Answer

14) Which of the following does not interrupt a Answer:a

running process ? (GATE CS 2001) Explanation:None.
a) A device
b) Timer 2. When several processes access the same data
c) Scheduler process concurrently and the outcome of the execution
d) Power failure depends on the particular order in which the access
View Answer takes place, is called
a) dynamic condition
Answer: c b) race condition
Explanation: None. c) essential condition
d) critical condition
15) Several processes access and manipulate the View Answer
same data concurrently and the outcome of the
execution depends on the particular order in which Answer:b
the access takes place, is called a(n) ____. Explanation:None.
a) Shared Memory Segments
b) Entry Section 3. If a process is executing in its critical section, then
c) Race condition no other processes can be executing in their critical
d) Process Synchronization section. This condition is called
View Answer a) mutual exclusion
b) critical exclusion
Answer: c c) synchronous exclusion
Explanation: None. d) asynchronous exclusion
View Answer
16) Which of the following state transitions is not
possible ? Answer:a
a) blocked to running Explanation:None.
b) ready to running
c) blocked to ready 4. Which one of the following is a synchronization
d) running to blocked tool?
View Answer a) thread
b) pipe
Answer: a c) semaphore
Explanation: None. d) socket
View Answer

Operating System Questions & Answer:c

Answers – Process Explanation:None.

Synchronization 5. A semaphore is a shared integer variable

a) that can not drop below zero
This section of our 1000+ Operating System MCQs b) that can not be more than zero
focuses on process synchronization in Operating c) that can not drop below one
System. d) that can not be more than one
1. Which process can be affected by other View Answer
processes executing in the system? Answer:a
a) cooperating process Explanation:None.
b) child process
c) parent process
6. Mutual exclusion can be provided by the Answer:a
a) mutex locks Explanation:None.
b) binary semaphores
c) both (a) and (b)
d) none of the mentioned
View Answer

Answer:c
Operating System Questions and
Explanation:Binary Semaphores are known as Answers – Process Creation
mutex locks.
This set of 1000+ Operating System MCQs focuses
7. When high priority task is indirectly preempted by on “Process Creation” and will also be useful for
medium priority task effectively inverting the relative interview preparations.
priority of the two tasks, the scenario is called
1) Restricting the child process to a subset of the
a) priority inversion
parent’s resources prevents any process from :
b) priority removal
a) overloading the system by using a lot of
c) priority exchange
secondary storage
d) priority modification
b) under-loading the system by very less CPU
View Answer
utilization
Answer:a c) overloading the system by creating a lot of sub-
Explanation:None. processes
d) crashing the system by utilizing multiple
8. Process synchronization can be done on resources
a) hardware level View Answer
b) software level
c) both (a) and (b) Answer: c
d) none of the mentioned Explanation: None.
View Answer
2) A parent process calling _____ system call will be
Answer:c suspended until children processes terminate.
Explanation:None. a) wait
b) fork
9. A monitor is a module that encapsulates c) exit
a) shared data structures d) exec
b) procedures that operate on shared data structure View Answer
c) synchronization between concurrent procedure
invocation Answer: a
d) all of the mentioned Explanation: None.
View Answer
3) Cascading termination refers to termination of all
Answer:d child processes before the parent terminates
Explanation:None. ______.
a) Normally
10. To enable a process to wait within the monitor, b) Abnormally
a) a condition variable must be declared as c) Normally or abnormally
condition d) None of these
b) condition variables must be used as boolean View Answer
objects
c) semaphore must be used Answer: a
d) all of the mentioned Explanation: None.
View Answer
4) With ……………. only one process can execute d) Dead
at a time; meanwhile all other process are waiting View Answer
for the processor. With ………….. more than one
process can be running simultaneously each on a Answer: b
different processor. Explanation: None.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing Operating System Questions and
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing Answers – Inter Process
View Answer Communication
Answer: d This set of 1000+ Operating System MCQs focuses
Explanation: None. on “Inter Process Communication”

5) In UNIX, each process is identified by its : 1) Inter process communication :

a) Process Control Block a) allows processes to communicate and
b) Device Queue synchronize their actions when using the same
c) Process Identifier address space.
d) None of these b) allows processes to communicate and
View Answer synchronize their actions without using the same
address space.
Answer: c c) allows the processes to only synchronize their
Explanation: None. actions without communication.
d) None of these
6) In UNIX, the return value for the fork system call
View Answer
is _____ for the child process and _____ for the
parent process. Answer: b
a) A Negative integer, Zero Explanation: None.
b) Zero, A Negative integer
c) Zero, A nonzero integer 2) Message passing system allows processes to :
d) A nonzero integer, Zero a) communicate with one another without resorting
View Answer to shared data.
b) communicate with one another by resorting to
Answer: c shared data.
Explanation: None. c) share data
d) name the recipient or sender of the message
7) The child process can : (choose two)
View Answer
a) be a duplicate of the parent process
b) never be a duplicate of the parent process Answer: a
c) have another program loaded into it Explanation: None.
d) never have another program loaded into it
View Answer 3) An IPC facility provides atleast two operations :
(choose two)
Answer: a and c a) write message
Explanation: None. b) delete message
c) send message
8) The child process completes execution,but the
d) receive message
parent keeps executing, then the child process is
View Answer
known as :
a) Orphan Answer: c and d
b) Zombie Explanation: None.
c) Body
4) Messages sent by a process : 8) In the non blocking send :
a) have to be of a fixed size a) the sending process keeps sending until the
b) have to be a variable size message is received
c) can be fixed or variable sized b) the sending process sends the message and
d) None of these resumes operation
View Answer c) the sending process keeps sending until it
receives a message
Answer: c d) None of these
Explanation: None. View Answer
5) The link between two processes P and Q to send Answer: b
and receive messages is called : Explanation: None.
a) communication link
b) message-passing link 9) In the Zero capacity queue : (choose two)
c) synchronization link a) the queue has zero capacity
d) All of these b) the sender blocks until the receiver receives the
View Answer message
c) the sender keeps sending and the messages
Answer: a dont wait in the queue
Explanation: None. d) the queue can store atleast one message
View Answer
6) Which of the following are TRUE for direct
communication choose two) Answer: a and b
a) A communication link can be associated with N Explanation: None.
number of process(N = max. number of processes
supported by system) 10) The Zero Capacity queue :
b) A communication link can be associated with a) is referred to as a message system with buffering
exactly two processes b) is referred to as a message system with no
c) Exactly N/2 links exist between each pair of buffering
processes(N = max. number of processes c) is referred to as a link
supported by system) d) None of these
d) Exactly one link exists between each pair of View Answer
processes
View Answer Answer: b
Explanation: None.
Answer: b and d
Explanation: None. 11) Bounded capacity and Unbounded capacity
queues are referred to as :
7) In indirect communication between processes P a) Programmed buffering
and Q : b) Automatic buffering
a) there is another process R to handle and pass on c) User defined buffering
the messages between P and Q d) No buffering
b) there is another machine between the two View Answer
processes to help communication
c) there is a mailbox to help communication Answer: b
between P and Q Explanation: None.
d) None of these
View Answer Operating System Questions and
Answer: c Answers – Remote Procedure
Explanation: None. Calls
This set of 1000+ Operating System MCQs focuses 5) To resolve the problem of data representation on
on “Remote Procedure Calls” different systems RPCs define ______________.
a) machine dependent representation of data
1) Remote Procedure Calls are used : b) machine representation of data
a) for communication between two processes c) machine-independent representation of data
remotely different from each other on the same d) None of these
system View Answer
b) for communication between two processes on the
same system Answer: c
c) for communication between two processes on Explanation: None.
separate systems
d) None of these 6) The full form of RMI :
View Answer a) Remote Memory Installation
b) Remote Memory Invocation
Answer: c c) Remote Method Installation
Explanation: None. d) Remote Method Invocation
View Answer
2) To differentiate the many network services a
system supports ______ are used. Answer: d
a) Variables Explanation: None.
b) Sockets
c) Ports 7) The remote method invocation :
d) Service names a) allows a process to invoke memory on a remote
View Answer object
b) allows a thread to invoke a method on a remote
Answer: c object
Explanation: None. c) allows a thread to invoke memory on a remote
object
3) RPC provides a(an) _____ on the client side, a d) allows a process to invoke a method on a remote
separate one for each remote procedure. object
a) stub View Answer
b) identifier
c) name Answer: b
d) process identifier Explanation: None.
View Answer
8) A process that is based on IPC mechanism which
Answer: a executes on different systems and can
Explanation: None. communicate with other processes using message
based communication, is called ________.
4) The stub : a) Local Procedure Call
a) transmits the message to the server where the b) Inter Process Communication
server side stub receives the message and invokes c) Remote Procedure Call
procedure on the server side d) Remote Machine Invocation
b) packs the parameters into a form transmittable View Answer
over the network
c) locates the port on the server Answer: c
d) All of these Explanation: None.
View Answer

Answer: d Operating System Questions and

Explanation: None. Answers – Process Structures
This set of 1000+ Operating System MCQs focuses d) None of these
on “Structures” View Answer

1) The initial program that is run when the computer Answer: a

is powered up is called : Explanation: None.
a) boot program
b) bootloader 6) DMA is used for : (choose two)
c) initializer a) High speed devices(disks and communications
d) bootstrap program network)
View Answer b) Low speed devices
c) Saving CPU cycles
Answer: d d) Utilizing CPU cycles
Explanation: None. View Answer

2) How does the software trigger an interrupt ? Answer: a and c

a) Sending signals to CPU through bus Explanation: None.
b) Executing a special operation called system call
c) Executing a special program called system 7) In a memory mapped input/output :
program a) the CPU uses polling to watch the control bit
d) Executing a special program calle interrupt trigger constantly, looping to see if device is ready
program b) the CPU writes one data byte to the data register
View Answer and sets a bit in control register to show that a byte
is available
Answer: b c) the CPU receives an interrupt when the device is
Explanation: None. ready for the next byte
d) the CPU runs a user written code and does
3) What is a trap/exception ? accordingly
a) hardware generated interrupt caused by an error View Answer
b) software generated interrupt caused by an error
c) user generated interrupt caused by an error Answer: b
d) None of these Explanation: None.
View Answer
8) In a programmed input/output(PIO) :
Answer: b a) the CPU uses polling to watch the control bit
Explanation: None. constantly, looping to see if device is ready
b) the CPU writes one data byte to the data register
4) What is an ISR ? and sets a bit in control register to show that a byte
a) Information Service Request is available
b) Interrupt Service Request c) the CPU receives an interrupt when the device is
c) Interrupt Service Routine ready for the next byte
d) Information Service Routine d) the CPU runs a user written code and does
View Answer accordingly
View Answer
Answer: c
Explanation: None. Answer: a
Explanation: None.
5) An interrupt vector
a) is an address that is indexed to an interrupt 9) In an interrupt driven input/output :
handler a) the CPU uses polling to watch the control bit
b) is a unique device number that is indexed by an constantly, looping to see if device is ready
address b) the CPU writes one data byte to the data register
c) is a unique identity given to an interrupt and sets a bit in control register to show that a byte
is available This section of our 1000+ Operating System MCQs
c) the CPU receives an interrupt when the device is focuses on cpu scheduling in Operating System.
ready for the next byte
d) the CPU runs a user written code and does 1. Which module gives control of the CPU to the
accordingly process selected by the short-term scheduler?
View Answer a) dispatcher
b) interrupt
Answer: c c) scheduler
Explanation: None. d) none of the mentioned
View Answer
10) In the layered approach of Operating Systems :
(choose two) Answer:a
a) Bottom Layer(0) is the User interface Explanation:None.
b) Highest Layer(N) is the User interface
c) Bottom Layer(0) is the hardware 2. The processes that are residing in main memory
d) Highest Layer(N) is the hardware and are ready and waiting to execute are kept on a
View Answer list called
a) job queue
Answer: b and c b) ready queue
Explanation: None. c) execution queue
d) process queue
11) How does the Hardware trigger an interrupt ? View Answer
a) Sending signals to CPU through system bus
b) Executing a special program called interrupt Answer:b
program Explanation:None.
c) Executing a special program called system
program 3. The interval from the time of submission of a
d) Executing a special operation called system call process to the time of completion is termed as
View Answer a) waiting time
b) turnaround time
Answer: a c) response time
Explanation: None. d) throughput
View Answer
12) Which operation is performed by an interrupt
handler ? Answer:b
a) Saving the current state of the system Explanation:None.
b) Loading the interrupt handling code and
executing it 4. Which scheduling algorithm allocates the CPU
c) Once done handling, bringing back the system to first to the process that requests the CPU first?
the original state it was before the interrupt occurred a) first-come, first-served scheduling
d) All of these b) shortest job scheduling
View Answer c) priority scheduling
d) none of the mentioned
Answer: d View Answer
Explanation: None.
Answer:a
Explanation:None.

5. In priority scheduling algorithm

Operating System Questions & a) CPU is allocated to the process with highest
Answers – CPU Scheduling priority
b) CPU is allocated to the process with lowest
priority
c) equal priority processes can not be scheduled b) user level thread
d) none of the mentioned c) process
View Answer d) none of the mentioned
View Answer
Answer:a
Explanation:None. Answer:b
Explanation:User level threads are managed by
6. In priority scheduling algorithm, when a process thread library and the kernel in unaware of them.
arrives at the ready queue, its priority is compared
with the priority of
a) all process Operating System Questions and
b) currently running process Answers – CPU Scheduling
c) parent process
d) init process
Benefits
View Answer This set of 1000+ Operating System MCQs focuses
on “CPU Scheduling Benefits”
Answer:b
Explanation:None. 1) CPU scheduling is the basis of ____________.
7. Time quantum is defined in a) multiprocessor systems
b) multiprogramming operating systems
a) shortest job scheduling algorithm
c) larger memory sized systems
b) round robin scheduling algorithm
d) None of these
c) priority scheduling algorithm
View Answer
d) multilevel queue scheduling algorithm
View Answer Answer: b
Explanation: None.
Answer:b
Explanation:None. 2) With multiprogramming, ______ is used
productively.
8. Process are classified into different groups in
a) time
a) shortest job scheduling algorithm
b) space
b) round robin scheduling algorithm
c) money
c) priority scheduling algorithm
d) All of these
d) multilevel queue scheduling algorithm
View Answer
View Answer
Answer: a
Answer:d
Explanation: None.
Explanation:None.
3) The two steps of a process execution are :
9. In multilevel feedback scheduling algorithm
(choose two)
a) a process can move to a different classified ready
a) I/O Burst
queue
b) CPU Burst
b) classification of ready queue is permanent
c) Memory Burst
c) processes are not classified into groups
d) OS Burst
d) none of the mentioned
View Answer
View Answer
Answer: a and b
Answer:a
Explanation: None.
Explanation:None.
4) An I/O bound program will typically have :
10. Which one of the following can not be scheduled
a) a few very short CPU bursts
by the kernel?
b) many very short I/O bursts
a) kernel level thread
c) many very short CPU bursts Answer: c
d) a few very short I/O bursts Explanation: None.
View Answer
9) Scheduling is done so as to :
Answer: c a) increase CPU utilization
Explanation: None. b) decrease CPU utilization
c) keep the CPU more idle
5) A process is selected from the ______ queue by d) None of these
the ________ scheduler, to be executed. View Answer
a) blocked, short term
b) wait, long term Answer: a
c) ready, short term Explanation: None.
d) ready, long term
View Answer 10) Scheduling is done so as to :
a) increase the throughput
Answer: c b) decrease the throughput
Explanation: None. c) increase the duration of a specific amount of work
d) None of these
6) In the following cases non – preemptive View Answer
scheduling occurs : (Choose two)
a) When a process switches from the running state Answer: a
to the ready state Explanation: None.
b) When a process goes from the running state to
the waiting state 11) Turnaround time is :
c) When a process switches from the waiting state a) the total waiting time for a process to finish
to the ready state execution
d) When a process terminates b) the total time spent in the ready queue
View Answer c) the total time spent in the running queue
d) the total time from the completion till the
Answer: b and d submission of a process
Explanation: There is no other choice. View Answer

7) The switching of the CPU from one process or Answer: d

thread to another is called : Explanation: None.
a) process switch
b) task switch 12) Scheduling is done so as to :
c) context switch a) increase the turnaround time
d) All of these b) decrease the turnaround time
View Answer c) keep the turnaround time same
d) there is no relation between scheduling and
Answer: d turnaround time
Explanation: None. View Answer

8) Dispatch latency is : Answer: b

a) the speed of dispatching a process from running Explanation: None.
to the ready state
b) the time of dispatching a process from running to 13) Waiting time is :
ready state and keeping the CPU idle a) the total time in the blocked and waiting queues
c) the time to stop one process and start running b) the total time spent in the ready queue
another one c) the total time spent in the running queue
d) None of these d) the total time from the completion till the
View Answer submission of a process
View Answer
Answer: b Answer: b
Explanation: None. Explanation: None.

14) Scheduling is done so as to : 2) With round robin scheduling algorithm in a time

a) increase the waiting time shared system,
b) keep the waiting time the same a) using very large time slices converts it into First
c) decrease the waiting time come First served scheduling algorithm
d) None of these b) using very small time slices converts it into First
View Answer come First served scheduling algorithm
c) using extremely small time slices increases
Answer: c performance
Explanation: None. d) using very small time slices converts it into
Shortest Job First algorithm
14) Response time is :
View Answer
a) the total time taken from the submission time till
the completion time Answer: a
b) the total time taken from the submission time till Explanation: All the processes will be able to get
the first response is produced completed.
c) the total time taken from submission time till the
response is output 3) The portion of the process scheduler in an
d) None of these operating system that dispatches processes is
View Answer concerned with :
a) assigning ready processes to CPU
Answer: b b) assigning ready processes to waiting queue
Explanation: None. c) assigning running processes to blocked queue
d) All of these
15) Scheduling is done so as to :
View Answer
a) increase the response time
b) keep the response time the same Answer: a
c) decrease the response time Explanation: None.
d) None of these
View Answer 4) Complex scheduling algorithms :
a) are very appropriate for very large computers
Answer: c b) use minimal resources
Explanation: None. c) use many resources
d) All of these
Operating System Questions and View Answer

Answers – CPU Scheduling Answer: a

Algorithms-1 Explanation: Large computers are overloaded with
greater number of processes.
This set of 1000+ Operating System MCQs focuses
on “CPU Scheduling Algorithms” 5) The FIFO algorithm :
a) first executes the job that came in last in the
1) Round robin scheduling falls under the category queue
of : b) first executes the job that came in first in the
a) Non preemptive scheduling queue
b) Preemptive scheduling c) first executes the job that needs minimal
c) None of these processor
View Answer d) first executes the job that has maximum
processor needs
View Answer
Answer: b 10) Which of the following algorithms tends to
Explanation: None. minimize the process flow time ?
a) First come First served
6) The strategy of making processes that are b) Shortest Job First
logically runnable to be temporarily suspended is c) Earliest Deadline First
called : d) Longest Job First
a) Non preemptive scheduling View Answer
b) Preemptive scheduling
c) Shortest job first Answer: b
d) First come First served Explanation: None.
View Answer
11) Under multiprogramming, turnaround time for
Answer: b short jobs is usually ________ and that for long jobs
Explanation: None. is slightly ___________.
a) Lengthened; Shortened
7) Scheduling is : b) Shortened; Lengthened
a) allowing a job to use the processor c) Shortened; Shortened
b) making proper use of processor d) Shortened; Unchanged
c) Both a and b View Answer
d) None of these
View Answer Answer: b
Explanation: None.
Answer: c
Explanation: None. 12) Which of the following statements are true ?
(GATE 2010)
8) There are 10 different processes running on a I. Shortest remaining time first scheduling may
workstation. Idle processes are waiting for an input cause starvation
event in the input queue. Busy processes are II. Preemptive scheduling may cause starvation
scheduled with the Round-Robin timesharing III. Round robin is better than FCFS in terms of
method. Which out of the following quantum times is response time
the best value for small response times, if the a) I only
processes have a short runtime, e.g. less than 10ms b) I and III only
? c) II and III only
a) tQ = 15ms d) I, II and III
b) tQ = 40ms View Answer
c) tQ = 45ms
d) tQ = 50ms Answer: d
View Answer Explanation:
I) Shortest remaining time first scheduling is a
Answer: a preemptive version of shortest job scheduling. It
Explanation: None. may cause starvation as shorter processes may
keep coming and a long CPU burst process never
9) Orders are processed in the sequence they arrive
gets CPU.
if _______ rule sequences the jobs.
II) Preemption may cause starvation. If priority
a) earliest due date
based scheduling with preemption is used, then a
b) slack time remaining
low priority process may never get CPU.
c) first come, first served
III) Round Robin Scheduling improves response
d) critical ratio
time as all processes get CPU after a specified time.
View Answer

Answer: c
Explanation: None.
Operating System Questions and b) The waiting time for process P1 is 0ms.
c) The waiting time for process P1 is 16ms.
Answers – CPU Scheduling d) The waiting time for process P1 is 9ms.
Algorithms-2 View Answer

This set of 1000+ Operating System MCQs focuses Answer: a

on “CPU Scheduling Algorithms” and will also be Explanation: None.
useful for interview preparations for freshers.
ii) Assuming the above process being scheduled
1) The most optimal scheduling algorithm is : with the SJF scheduling algorithm :
a) FCFS – First come First served a) The waiting time for process P2 is 3ms.
b) SJF – Shortest Job First b) The waiting time for process P2 is 0ms.
c) RR – Round Robin c) The waiting time for process P2 is 16ms.
d) None of these d) The waiting time for process P2 is 9ms.
View Answer View Answer

Answer: b Answer: c
Explanation: None. Explanation: None.

2) The real difficulty with SJF in short term iii) Assuming the above process being scheduled
scheduling is : with the SJF scheduling algorithm :
a) it is too good an algorithm a) The waiting time for process P4 is 3ms.
b) knowing the length of the next CPU request b) The waiting time for process P4 is 0ms.
c) it is too complex to understand c) The waiting time for process P4 is 16ms.
d) None of these d) The waiting time for process P4 is 9ms.
View Answer View Answer

Answer: b Answer: b
Explanation: None. Explanation: None.

3) The FCFS algorithm is particularly troublesome iv) Assuming the above process being scheduled
for ____________. with the SJF scheduling algorithm :
a) time sharing systems a) The waiting time for process P3 is 3ms.
b) multiprogramming systems b) The waiting time for process P3 is 0ms.
c) multiprocessor systems c) The waiting time for process P3 is 16ms.
d) Operating systems d) The waiting time for process P3 is 9ms.
View Answer View Answer

Answer: b Answer: d
Explanation: In a time sharing system, each user Explanation: None.
needs to get a share of the CPU at regular intervals.
5) Preemptive Shortest Job First scheduling is
4) Consider the following set of processes, the sometimes called :
length of the CPU burst time given in milliseconds : a) Fast SJF scheduling
Process Burst time b) EDF scheduling – Earliest Deadline First
P1 6 c) HRRN scheduling – Highest Response Ratio
P2 8 Next
P3 7 d) SRTN scheduling – Shortest Remaining Time
P4 3 Next
View Answer
i) Assuming the above process being scheduled
with the SJF scheduling algorithm : Answer: d
a) The waiting time for process P1 is 3ms. Explanation: None.
6) An SJF algorithm is simply a priority algorithm ii) Preemptive scheduling may cause starvation
where the priority is : iii) Round robin is better than FCFS in terns of
a) the predicted next CPU burst response time
b) the inverse of the predicted next CPU burst
c) the current CPU burst a) i only
d) anything the user wants b) i and iii only
View Answer c) ii and iii only
d) i, ii and iii
Answer: a View Answer
Explanation: The larger the CPU burst, the lower the
priority. Answer: d
Explanation: None.
7) One of the disadvantages of the priority
scheduling algorithm is that : 11) Which of the following scheduling algorithms
a) it schedules in a very complex manner gives minimum average waiting time ?
b) its scheduling takes up a lot of time a) FCFS
c) it can lead to some low priority process waiting b) SJF
indefinitely for the CPU c) Round – robin
d) None of these d) Priority
View Answer View Answer

Answer: c Answer: b
Explanation: None. Explanation: None.

8) ‘Aging’ is :
a) keeping track of cache contents
b) keeping track of what pages are currently residing
in memory
c) keeping track of how many times a given page is Operating System Questions and
referenced Answers – The Critical Section
d) increasing the priority of jobs to ensure
termination in a finite time (CS) Problem and Solutions
View Answer This set of 1000+ Operating System MCQs focuses
Answer: d on “The Critical Section (CS) Problem and
Explanation: None. Solutions”

9) A solution to the problem of indefinite blockage of 1) Concurrent access to shared data may result in :
low – priority processes is : a) data consistency
a) Starvation b) data insecurity
b) Wait queue c) data inconsistency
c) Ready queue d) None of these
d) Aging View Answer
View Answer Answer: c
Answer: d Explanation: None.
Explanation: None. 2) A situation where several processes access and
10) Which of the following statements are true ? manipulate the same data concurrently and the
(GATE 2010) outcome of the execution depends on the particular
i) Shortest remaining time first scheduling may order in which access takes place is called :
cause starvation a) data consistency
b) race condition
c) aging b) when another process is in its critical section
d) starvation c) before a process has made a request to enter its
View Answer critical section
d) None of these
Answer: b View Answer
Explanation: None.
Answer: a
3) The segment of code in which the process may Explanation: None.
change common variables, update tables, write into
files is known as : 7) A minimum of _____ variable(s) is/are required to
a) program be shared between processes to solve the critical
b) critical section section problem.
c) non – critical section a) one
d) synchronizing b) two
View Answer c) three
d) four
Answer: b View Answer
Explanation: None.
Answer: b
4) The following three conditions must be satisfied Explanation: None.
to solve the critical section problem : (choose three)
a) Aging 8) In the bakery algorithm to solve the critical
b) Mutual Exclusion section problem :
c) Deadlock a) each process is put into a queue and picked up in
d) Progress an ordered manner
e) Bounded Waiting b) each process receives a number (may or may not
View Answer be unique) and the one with the lowest number is
served next
Answer: b,d and e c) each process gets a unique number and the one
Explanation: None. with the highest number is served next
d) each process gets a unique number and the one
5) Mutual exclusion implies that :
with the lowest number is served next
a) if a process is executing in its critical section, then
View Answer
no other process must be executing in their critical
sections Answer: b
b) if a process is executing in its critical section, then Explanation: None.
other processes must be executing in their critical
sections
c) if a process is executing in its critical section, then Operating System Questions and
all the resources of the system must be blocked until Answers – Semaphores – 1
it finishes execution
d) None of these This set of 1000+ Operating System MCQs focuses
View Answer on “Semaphores”

Answer: a 1) An un-interruptible unit is known as :

Explanation: None. a) single
b) atomic
6) Bounded waiting implies that there exists a bound c) static
on the number of times a process is allowed to enter d) None of these
its critical section : View Answer
a) after a process has made a request to enter its
critical section and before the request is granted
Answer: b Answer: b
Explanation: None. Explanation: None.

2) The TestAndSet instruction is executed : 7) The wait operation of the semaphore basically
a) after a particular process works on the basic _______ system call.
b) periodically a) stop()
c) atomically b) block()
d) None of these c) hold()
View Answer d) wait()
View Answer
Answer: c
Explanation: None. 8) The signal operation of the semaphore basically
works on the basic _______ system call.
3) Semaphore is a/an _______ to solve the critical a) continue()
section problem. b) wakeup()
a) hardware for a system c) getup()
b) special program for a system d) start()
c) integer variable View Answer
d) None of these
View Answer Answer: b
Explanation: None.
Answer: c
Explanation: None. 9) If the semaphore value is negative :
a) its magnitude is the number of processes waiting
4) The two atomic operations permissible on on that semaphore
semaphores are : (choose two) b) it is invalid
a) wait c) no operation can be further performed on it until
b) stop the signal operation is performed on it
c) hold d) None of these
d) signal View Answer
View Answer
Answer: a
Answer: a and d Explanation: None.
Explanation: None.
10) The code that changes the value of the
5) Spinlocks are : semaphore is :
a) CPU cycles wasting locks over critical sections of a) remainder section code
programs b) non – critical section code
b) locks that avoid time wastage in context switches c) critical section code
c) locks that work better on multiprocessor systems d) None of these
d) All of these View Answer
View Answer
Answer: c
Answer: d Explanation: None.
Explanation: None.
11) The following program consists of 3 concurrent
6) The main disadvantage of spinlocks is that : processes and 3 binary semaphores. The
a) they are not sufficient for many process semaphores are initialized as S0 = 1, S1 = 0, S2 =
b) they require busy waiting 0.
c) they are unreliable sometimes Process P0
d) they are too complex for programmers while(true)
View Answer {
wait(S0); 13) Two processes, P1 and P2, need to access a
print ’0′; critical section of code. Consider the following
release(S1); synchronization construct used by the processes :
release(S2); Process P1 :
} while(true)
{
Process P1 w1 = true;
wait(S1); while(w2 == true);
release(S0); Critical section
w1 = false;
Process P2
}
wait(S2);
Remainder Section
release(S0);
Process P2 :
How many times will P0 print ’0′ ?
while(true)
a) At least twice
{
b) Exactly twice
w2 = true;
c) Exactly thrice
while(w1 == true);
d) Exactly once
Critical section
View Answer
w2 = false;
Answer: a }
Explanation: None. Remainder Section

12) Each process Pi, i = 0,1,2,3,……,9 is coded as Here, w1 and w2 are shared variables, which are
follows : initialized to false. Which one of the following
repeat statements is TRUE about the above construct?
P(mutex) a) It does not ensure mutual exclusion
{Critical Section} b) It does not ensure bounded waiting
V(mutex) c) It requires that processes enter the critical section
forever in strict alternation
The code for P10 is identical except that it uses d) It does not prevent deadlocks, but ensures
V(mutex) instead of P(mutex). What is the largest mutual exclusion
number of processes that can be inside the critical View Answer
section at any moment (the mutex being initialized
Answer: d
to 1)?
Explanation: None.
a) 1
b) 2
c) 3 Operating System Questions and
d) None of these
View Answer
Answers – Semaphores – 2
This set of 1000+ Operating System MCQs focuses
Answer: c
on “Semaphores” and will also be useful for
Explanation: Any one of the 9 processes can get
interview preparations for freshers.
into critical section after executing P(mutex) which
decrements the mutex value to 0. At this time P10 1) What will happen if a non-recursive mutex is
can enter critical section by incrementing the value locked more than once ?
to 1. Now any of the 9 processes can enter the a) Starvation
critical section by again decrementing the mutex b) Deadlock
value to 0. None of the remaining processes can get c) Aging
into their critical sections.
d) Signaling Signal. P operation will decrease the value by 1
View Answer everytime and V operation will increase the value by
1 everytime.
Answer: b
Explanation: If a thread which had already locked a 6) A binary semaphore is a semaphore with integer
mutex, tries to lock the mutex again, it will enter into values : (choose two)
the waiting list of that mutex, which results in a) 1
deadlock. It is because no other thread can unlock b) -1
the mutex. c) 0
d) 0.5
2) A semaphore : View Answer
a) is a binary mutex
b) must be accessed from only one process Answer: a and c
c) can be accessed from multiple processes Explanation: None.
d) None of these
View Answer 7) The following pair of processes share a common
variable X :
Answer: c Process A
Explanation: None. int Y;
A1: Y = X*2;
3) The two kinds of semaphores are : (choose two) A2: X = Y;
a) mutex
b) binary Process B
c) counting int Z;
d) decimal B1: Z = X+1;
View Answer B2: X = Z;

Answer: b and c X is set to 5 before either process begins execution.

Explanation: None. As usual, statements within a process are executed
sequentially, but statements in process A may
4) A mutex : execute in any order with respect to statements in
a) is a binary mutex process B.
b) must be accessed from only one process i) How many different values of X are possible after
c) can be accessed from multiple processes both processes finish executing ?
d) None of these a) two
View Answer b) three
c) four
Answer: b
d) eight
Explanation: None.
View Answer
5) At a particular time of computation the value of a
Answer: c
counting semaphore is 7.Then 20 P operations and
Explanation: Here are the possible ways in which
15 V operations were completed on this
statements from A and B can be interleaved.
semaphore.The resulting value of the semaphore
A1 A2 B1 B2: X = 11
is : (GATE 1987)
A1 B1 A2 B2: X = 6
a) 42
A1 B1 B2 A2: X = 10
b) 2
B1 A1 B2 A2: X = 10
c) 7
B1 A1 A2 B2: X = 6
d) 12
B1 B2 A1 A2: X = 12
View Answer
ii) Suppose the programs are modified as follows to
Answer: b
use a shared binary semaphore T :
Explanation: P represents Wait and V represents
Process A Operating System Questions and
int Y;
A1: Y = X*2; Answers – Classic
A2: X = Y; Synchronization Problems
signal(T);
This set of 1000+ Operating System MCQs focuses
Process B on “The Classic Synchronization Problems”
int Z;
B1: wait(T); 1) The bounded buffer problem is also known as :
B2: Z = X+1; a) Readers – Writers problem
X = Z; b) Dining – Philosophers problem
c) Producer – Consumer problem
T is set to 0 before either process begins execution d) None of these
and, as before, X is set to 5. View Answer
Now, how many different values of X are possible
after both processes finish executing ? Answer: c
a) one Explanation: None.
b) two
2) In the bounded buffer problem, there are the
c) three
empty and full semaphores that :
d) four
a) count the number of empty and full buffers
View Answer
b) count the number of empty and full memory
Answer: a spaces
Explanation:The semaphore T ensures that all the c) count the number of empty and full queues
statements from A finish execution before B begins. d) None of these
So now there is only one way in which statements View Answer
from A and B can be interleaved:
Answer: a
A1 A2 B1 B2: X = 11.
Explanation: None.
8) Semaphores are mostly used to implement :
3) In the bounded buffer problem :
a) System calls
a) there is only one buffer
b) IPC mechanisms
b) there are n buffers ( n being greater than one but
c) System protection
finite)
d) None of these
c) there are infinite buffers
View Answer
d) the buffer size is bounded
Answer: b View Answer
Explanation: None.
Answer: b
9) Spinlocks are intended to provide __________ Explanation: None.
only.
4) To ensure difficulties do not arise in the readers –
a) Mutual Exclusion
writers problem, _______ are given exclusive
b) Bounded Waiting
access to the shared object.
c) Aging
a) readers
d) Progress
b) writers
View Answer
c) None of these
Answer: b View Answer
Explanation: None.
Answer: b
Explanation: None.
5) The dining – philosophers problem will occur in c) several processes maybe executing in their
case of : critical section
a) 5 philosophers and 5 chopsticks d) All of these
b) 4 philosophers and 5 chopsticks View Answer
c) 3 philosophers and 5 chopsticks
d) 6 philosophers and 5 chopsticks Answer: a
View Answer Explanation: None.

Answer: a 8) Consider the methods used by processes P1 and

Explanation: None. P2 for accessing their critical sections whenever
needed, as given below. The initial values of shared
6) A deadlock free solution to the dining boolean variables S1 and S2 are randomly
philosophers problem : assigned. (GATE 2010)
a) necessarily eliminates the possibility of starvation
b) does not necessarily eliminate the possibility of Method used by P1 :
starvation while(S1==S2);
c) eliminates any possibility of any kind of problem Critical section
further S1 = S2;
d) None of these Method used by P2 :
View Answer while(S1!=S2);
Answer: b Critical section
Explanation: None. S2 = not(S1);

7) All processes share a semaphore variable mutex, Which of the following statements describes
initialized to 1. Each process must execute properties achieved ?
wait(mutex) before entering the critical section and a) Mutual exclusion but not progress
signal(mutex) afterward. b) Progress but not mutual exclusion
c) Neither mutual exclusion nor progress
i) Suppose a process executes in the following d) Both mutual exclusion and progress
manner : View Answer
signal(mutex);
….. Answer: d
critical section Explanation: None.
…..
wait(mutex);

In this situation : Operating System Questions and

a) a deadlock will occur
b) processes will starve to enter critical section Answers – Classic
c) several processes maybe executing in their Synchronization Problems
critical section
d) All of these This set of 1000+ Operating System MCQs focuses
View Answer on “The Classic Synchronization Problems”

Answer: c 1) The bounded buffer problem is also known as :

Explanation: None. a) Readers – Writers problem
b) Dining – Philosophers problem
ii) Suppose a process executes in the following c) Producer – Consumer problem
manner (replacing signal with wait) : d) None of these
a) a deadlock will occur View Answer
b) processes will starve to enter critical section
Answer: c c) eliminates any possibility of any kind of problem
Explanation: None. further
d) None of these
2) In the bounded buffer problem, there are the View Answer
empty and full semaphores that :
a) count the number of empty and full buffers Answer: b
b) count the number of empty and full memory Explanation: None.
spaces
c) count the number of empty and full queues 7) All processes share a semaphore variable mutex,
d) None of these initialized to 1. Each process must execute
View Answer wait(mutex) before entering the critical section and
signal(mutex) afterward.
Answer: a
Explanation: None. i) Suppose a process executes in the following
manner :
3) In the bounded buffer problem : signal(mutex);
a) there is only one buffer …..
b) there are n buffers ( n being greater than one but critical section
finite) …..
c) there are infinite buffers wait(mutex);
d) the buffer size is bounded
View Answer In this situation :
a) a deadlock will occur
Answer: b b) processes will starve to enter critical section
Explanation: None. c) several processes maybe executing in their
critical section
4) To ensure difficulties do not arise in the readers – d) All of these
writers problem, _______ are given exclusive View Answer
access to the shared object.
a) readers Answer: c
b) writers Explanation: None.
c) None of these
View Answer ii) Suppose a process executes in the following
manner (replacing signal with wait) :
Answer: b a) a deadlock will occur
Explanation: None. b) processes will starve to enter critical section
c) several processes maybe executing in their
5) The dining – philosophers problem will occur in critical section
case of : d) All of these
a) 5 philosophers and 5 chopsticks View Answer
b) 4 philosophers and 5 chopsticks
c) 3 philosophers and 5 chopsticks Answer: a
d) 6 philosophers and 5 chopsticks Explanation: None.
View Answer
8) Consider the methods used by processes P1 and
Answer: a P2 for accessing their critical sections whenever
Explanation: None. needed, as given below. The initial values of shared
boolean variables S1 and S2 are randomly
6) A deadlock free solution to the dining assigned. (GATE 2010)
philosophers problem :
a) necessarily eliminates the possibility of starvation Method used by P1 :
b) does not necessarily eliminate the possibility of while(S1==S2);
starvation
Critical section d) monitor, monitor
S1 = S2; View Answer

Method used by P2 : Answer: d

while(S1!=S2); Explanation: None.
Critical section
S2 = not(S1); 4) The monitor construct ensures that :
a) only one process can be active at a time within
Which of the following statements describes the monitor
properties achieved ? b) n number of processes can be active at a time
a) Mutual exclusion but not progress within the monitor (n being greater than 1)
b) Progress but not mutual exclusion c) the queue has only one process in it at a time
c) Neither mutual exclusion nor progress d) All of these
d) Both mutual exclusion and progress View Answer
View Answer
Answer: a
Answer: d Explanation: None.
Explanation: None.
5) The operations that can be invoked on a
condition variable are : (choose two)
Operating System Questions and a) wait
Answers – Monitors b) hold
c) signal
This set of 1000+ Operating System MCQs focuses d) continue
on “Monitors” View Answer

1) A monitor is a type of : Answer: a and c

a) semaphore Explanation: None.
b) low level synchronization construct
c) high level synchronization construct 6) The process invoking the wait operation is :
d) None of these a) suspended until another process invokes the
View Answer signal operation
b) waiting for another process to complete before it
Answer: c can itself call the signal operation
Explanation: None. c) stopped until the next process in the queue
finishes execution
2) A monitor is characterized by : d) None of these
a) a set of programmer defined operators View Answer
b) an identifier
c) the number of variables in it Answer: a
d) All of these Explanation: None.
View Answer
7) If no process is suspended, the signal operation :
Answer: a a) puts the system into a deadlock state
Explanation: None. b) suspends some default process’ execution
c) nothing happens
3) A procedure defined within a ________ can d) the output is unpredictable
access only those variables declared locally within View Answer
the _______ and its formal parameters.
a) process, semaphore Answer: c
b) process, monitor Explanation: None.
c) semaphore, semaphore
Operating System Questions and 5) In the write ahead logging a _____ is maintained.
a) a memory
Answers – Atomic Transactions b) a system
c) a disk
This set of 1000+ Operating System MCQs focuses
d) a log record
on “Atomic Transactions”
View Answer
1) A collection of instructions that performs a single
Answer: d
logical function is called :
Explanation: None.
a) transaction
b) operation 6) An actual update is not allowed to a data item :
c) function a) before the corresponding log record is written out
d) All of these to stable storage
View Answer b) after the corresponding log record is written out to
stable storage
Answer: a
c) until the whole log record has been checked for
Explanation: None.
inconsistencies
2) A terminated transaction that has completed its d) All of these
execution successfully is ____________, otherwise View Answer
it is __________.
Answer: a
a) committed, destroyed
Explanation: None.
b) aborted, destroyed
c) committed, aborted 7) The undo and redo operations must be
d) None of these _________ to guarantee correct behaviour, even if
View Answer a failure occurs during recovery process.
a) idempotent
Answer: c
b) easy
Explanation: None.
c) protected
3) The state of the data accessed by an aborted d) All of these
transaction must be restored to what it was just View Answer
before the transaction started executing. This
Answer: a
restoration is known as ________ of transaction.
Explanation: Idempotent – Multiple executions of an
a) safety
operation have the same result as does one
b) protection
execution.
c) roll – back
d) revert – back 8) The system periodically performs checkpoints
View Answer that consists of the following operation(s) :
a) Putting all the log records currently in main
Answer: c
memory onto stable storage
Explanation: None.
b) putting all modified data residing in main memory
4) Write ahead logging is a way : onto stable storage
a) to ensure atomicity c) putting a log record onto stable storage
b) to keep data consistent d) All of these
c) that records data on stable storage View Answer
d) All of these
Answer: d
View Answer
Explanation: None.
Answer: d
9) Consider a transaction T1 that committed prior to
Explanation: None.
checkpoint. The record appears in the log before
the record. Any modifications made by T1 must release any
have been written to the stable storage either with b) A transaction may obtain locks, and releases a
the checkpoint or prior to it. Thus at recovery time : ( few or all of them
choose all that apply ) c) A transaction may release locks, but does not
a) There is a need to perform an undo operation on obtain any new locks
T1 d) A transaction may release locks, and does obtain
b) There is a need to perform a redo operation on new locks
T1 View Answer
c) There is no need to perform an undo operation on
T1 Answer: a
d) There is no need to perform a redo operation on Explanation: None.
T1 14) The shrinking phase is a phase in which :
View Answer a) A transaction may obtain locks, but does not
Answer: c and d release any
Explanation: None. b) A transaction may obtain locks, and releases a
few or all of them
10) Serializable schedules are ones where : c) A transaction may release locks, but does not
a) concurrent execution of transactions is equivalent obtain any new locks
to the transactions executed serially d) A transaction may release locks, and does obtain
b) the transactions can be carried out one after the new locks
other View Answer
c) a valid result occurs after execution transactions
d) None of these Answer: c
View Answer Explanation: None.

Answer: a 15) Which of the following concurrency control

Explanation: None. protocols ensure both conflict serializability and
freedom from deadlock ?
11) A locking protocol is one that : I) 2-phase locking
a) governs how locks are acquired II) Time-stamp ordering
b) governs how locks are released
c) governs how locks are acquired and released a) I only
d) None of these b) II only
View Answer c) Both I and II
d) Neither I nor II
Answer: c View Answer
Explanation: None.
Answer: b
12) The two phase locking protocol consists of : Explanation: None.
(choose two)
a) growing phase
b) shrinking phase Operating System Questions &
c) creation phase Answers – Deadlock
d) destruction phase
View Answer This section of our 1000+ Operating System MCQs
focuses on deadlock in Operating System.
Answer: a and b
Explanation: None. 1. What is the reusable resource?
a) that can be used by one process at a time and is
13) The growing phase is a phase in which : not depleted by that use
a) A transaction may obtain locks, but does not b) that can be used by more than one process at a
time 6. What is the drawback of banker’s algorithm?
c) that can be shared between various threads a) in advance processes rarely know that how much
d) none of the mentioned resource they will need
View Answer b) the number of processes changes as time
progresses
Answer:a c) resource once available can disappear
Explanation:None. d) all of the mentioned
View Answer
2. Which of the following condition is required for
deadlock to be possible? Answer:d
a) mutual exclusion Explanation:None.
b) a process may hold allocated resources while
awaiting assignment of other resources 7. For effective operating system, when to check for
c) no resource can be forcibly removed from a deadlock?
process holding it a) every time a resource request is made
d) all of the mentioned b) at fixed time intervals
View Answer c) both (a) and (b)
d) none of the mentioned
Answer:d View Answer
Explanation:None.
Answer:c
3. A system is in the safe state if Explanation:None.
a) the system can allocate resources to each
process in some order and still avoid a deadlock 8. A problem encountered in multitasking when a
b) there exist a safe sequence process is perpetually denied necessary resources
c) both (a) and (b) is called
d) none of the mentioned a) deadlock
View Answer b) starvation
c) inversion
Answer:c d) aging
Explanation:None. View Answer
4. The circular wait condition can be prevented by Answer:b
a) defining a linear ordering of resource types Explanation:None.
b) using thread
c) using pipes 9. Which one of the following is a visual
d) all of the mentioned ( mathematical ) way to determine the deadlock
View Answer occurrence?
a) resource allocation graph
Answer:a b) starvation graph
Explanation:None. c) inversion graph
d) none of the mentioned
5. Which one of the following is the deadlock
View Answer
avoidance algorithm?
a) banker’s algorithm Answer:a
b) round-robin algorithm Explanation:None.
c) elevator algorithm
d) karn’s algorithm 10. To avoid deadlock
View Answer a) there must be a fixed number of resources to
allocate
Answer:a b) resource allocation must be done only once
Explanation:None. c) all deadlocked processes must be aborted
d) inversion technique can be used a) Mutual exclusion
View Answer b) Starvation
c) Hold and wait
Answer:a d) No preemption
Explanation:Non e) Circular wait
View Answer
Operating System Questions and Answer: a, c, d and e
Answers – Deadlock Prevention Explanation: None.

This set of 1000+ Operating System MCQs focuses 5) For Mutual exclusion to prevail in the system :
on “Deadlock Prevention” a) at least one resource must be held in a non
sharable mode
1) The number of resources requested by a process b) the processor must be a uniprocessor rather than
: a multiprocessor
a) must always be less than the total number of c) there must be at least one resource in a sharable
resources available in the system mode
b) must always be equal to the total number of d) All of these
resources available in the system View Answer
c) must not exceed the total number of resources
available in the system Answer: a
d) must exceed the total number of resources Explanation: If another process requests that
available in the system resource (non – shareable resource), the requesting
View Answer process must be delayed until the resource has
been released.
Answer: c
Explanation: None. 6) For a Hold and wait condition to prevail :
a) A process must be not be holding a resource, but
2) The request and release of resources are waiting for one to be freed, and then request to
___________. acquire it
a) command line statements b) A process must be holding at least one resource
b) interrupts and waiting to acquire additional resources that are
c) system calls being held by other processes
d) special programs c) A process must hold at least one resource and
View Answer not be waiting to acquire additional resources
d) None of these
Answer: c
View Answer
Explanation: None.
Answer: b
3) Multithreaded programs are :
Explanation: None.
a) lesser prone to deadlocks
b) more prone to deadlocks 7) Deadlock prevention is a set of methods :
c) not at all prone to deadlocks a) to ensure that at least one of the necessary
d) None of these conditions cannot hold
View Answer b) to ensure that all of the necessary conditions do
not hold
Answer: b
c) to decide if the requested resources for a process
Explanation: Multiple threads can compete for
have to be given or not
shared resources.
d) to recover from a deadlock
4) For a deadlock to arise, which of the following View Answer
conditions must hold simultaneously ? ( choose all
that apply )
Answer: a Answer: b
Explanation: None. Explanation: None.

8) For non sharable resources like a printer, mutual 12) To ensure no preemption, if a process is holding
exclusion : some resources and requests another resource that
a) must exist cannot be immediately allocated to it :
b) must not exist a) then the process waits for the resources be
c) may exist allocated to it
d) None of these b) the process keeps sending requests until the
View Answer resource is allocated to it
c) the process resumes execution without the
Answer: a resource being allocated to it
Explanation: A printer cannot be simultaneously d) then all resources currently being held are
shared by several processes. preempted
View Answer
9) For sharable resources, mutual exclusion :
a) is required Answer: d
b) is not required Explanation: None.
c) None of these
View Answer 13) One way to ensure that the circular wait
condition never holds is to :
Answer: b a) impose a total ordering of all resource types and
Explanation: They do not require mutually exclusive to determine whether one precedes another in the
access, and hence cannot be involved in a ordering
deadlock. b) to never let a process acquire resources that are
held by other processes
10) To ensure that the hold and wait condition never
c) to let a process wait for only one resource at a
occurs in the system, it must be ensured that :
time
a) whenever a resource is requested by a process, it
d) All of these
is not holding any other resources
View Answer
b) each process must request and be allocated all
its resources before it begins its execution Answer: a
c) a process can request resources only when it has Explanation: None.
none
d) All of these
View Answer Operating System Questions and
Answer: d
Answers – Deadlock Avoidance
Explanation: c – A process may request some This set of 1000+ Operating System MCQs focuses
resources and use them. Before it can can request on “Deadlock Avoidance”
any additional resources, however it must release all
the resources that it is currently allocated. 1) Each request requires that the system consider
the __________, _____________, ____________
11) The disadvantage of a process being allocated to decide whether the current request can be
all its resources before beginning its execution is : satisfied or must wait to avoid a future possible
a) Low CPU utilization deadlock. (choose three)
b) Low resource utilization a) resources currently available
c) Very high resource utilization b) processes that have previously been in the
d) None of these system
View Answer c) resources currently allocated to each process
d) future requests and releases of each process
View Answer
Answer: a, c and d 6) All unsafe states are :
Explanation: None. a) deadlocks
b) not deadlocks
2) Given a priori information about the ________ c) fatal
number of resources of each type that maybe d) None of these
requested for each process, it is possible to View Answer
construct an algorithm that ensures that the system
will never enter a deadlock state. Answer: b
a) minimum Explanation: None.
b) average
c) maximum 7) A system has 12 magnetic tape drives and 3
d) approximate processes : P0, P1, and P2. Process P0 requires 10
View Answer tape drives, P1 requires 4 and P2 requires 9 tape
drives.
Answer: c
Explanation: None. Process
P0
3) A deadlock avoidance algorithm dynamically P1
examines the __________, to ensure that a circular P2
wait condition can never exist.
a) resource allocation state Maximum needs (process-wise : P0 through P2 top
b) system storage state to bottom)
c) operating system 10
d) resources 4
View Answer 9

Answer: a Currently allocated (process-wise)

Explanation: Resource allocation states are used to 5
maintain the availability of the already and current 2
available resources. 2

4) A state is safe, if : Which of the following sequence is a safe

a) the system does not crash due to deadlock sequence ?
occurrence a) P0, P1, P2
b) the system can allocate resources to each b) P1, P2, P0
process in some order and still avoid a deadlock c) P2, P0, P1
c) the state keeps the system protected and safe d) P1, P0, P2
d) All of these View Answer
View Answer Answer: d
Answer: b Explanation: None.
Explanation: None. 8) If no cycle exists in the resource allocation
5) A system is in a safe state only if there exists a : graph :
a) safe allocation a) then the system will not be in a safe state
b) safe resource b) then the system will be in a safe state
c) safe sequence c) either a or b
d) All of these d) None of these
View Answer View Answer

Answer: c Answer: b
Explanation: None. Explanation: None.
9) The resource allocation graph is not applicable to P3
a resource allocation system : P4
a) with multiple instances of each resource type
b) with a single instance of each resource type Allocation (process-wise : P0 through P4 top to
c) Both a and b bottom)
View Answer ABC
010
Answer: a 200
Explanation: None. 302
211
10) The Banker’s algorithm is _____________ than 002
the resource allocation graph algorithm.
a) less efficient Max (process-wise : P0 through P4 top to bottom)
b) more efficient ABC
c) None of these 753
View Answer 322
902
Answer: a 222
Explanation: None. 433
11) The data structures available in the Banker’s Available
algorithm are : (choose all that apply) ABC
a) Available 332
b) Need The sequence leads the system to :
c) Allocation a) an unsafe state
d) Maximum b) a safe state
e) Minimum c) a protected state
f) All of these d) a deadlock
View Answer View Answer
Answer: a,b,c,d Answer: b
Explanation: None. Explanation: None.
12) The content of the matrix Need is :
a) Allocation – Available
b) Max – Available
c) Max – Allocation
d) Allocation – Max Operating System Questions and
View Answer Answers – Deadlock Detection
Answer: c This set of 1000+ Operating System MCQs focuses
Explanation: None. on “Deadlock Detection”
13) A system with 5 processes P0 through P4 and 1) The wait-for graph is a deadlock detection
three resource types A, B, C has A with 10 algorithm that is applicable when :
instances, B with 5 instances, and C with 7 a) all resources have a single instance
instances. At time t0, the following snapshot has b) all resources have multiple instances
been taken : c) both a and b
View Answer
Process
P0 Answer: a
P1 Explanation: None.
P2
2) An edge from process Pi to Pj in a wait for graph d) None of these
indicates that : View Answer
a) Pi is waiting for Pj to release a resource that Pi
needs Answer: b
b) Pj is waiting for Pi to release a resource that Pj Explanation: None.
needs 7) Every time a request for allocation cannot be
c) Pi is waiting for Pj to leave the system granted immediately, the detection algorithm is
d) Pj is waiting for Pi to leave the system invoked. This will help identify : (choose all that
View Answer apply)
Answer: a a) the set of processes that have been deadlocked
Explanation: None. b) the set of processes in the deadlock queue
c) the specific process that caused the deadlock
3) If the wait for graph contains a cycle : d) All of these
a) then a deadlock does not exist View Answer
b) then a deadlock exists
c) then the system is in a safe state Answer: a and c
d) either b or c Explanation: None.
View Answer 8) A computer system has 6 tape drives, with ‘n’
Answer: b processes competing for them. Each process may
Explanation: None. need 3 tape drives. The maximum value of ‘n’ for
which the system is guaranteed to be deadlock free
4) If deadlocks occur frequently, the detection is :
algorithm must be invoked ________. a) 2
a) rarely b) 3
b) frequently c) 4
c) None of these d) 1
View Answer View Answer

Answer: b Answer: a
Explanation: None. Explanation: None.

5) The disadvantage of invoking the detection 9) A system has 3 processes sharing 4 resources. If
algorithm for every request is : each process needs a maximum of 2 units then,
a) overhead of the detection algorithm due to deadlock :
consumption of memory a) can never occur
b) excessive time consumed in the request to be b) may occur
allocated memory c) has to occur
c) considerable overhead in computation time d) None of these
d) All of these View Answer
View Answer
Answer: a
Answer: c Explanation: None.
Explanation: None.
10) ‘m’ processes share ‘n’ resources of the same
6) A deadlock eventually cripples system throughput type. The maximum need of each process doesn’t
and will cause the CPU utilization to ______. exceed ‘n’ and the sum of all their maximum needs
a) increase is always less than m+n. In this setup, deadlock :
b) drop a) can never occur
c) stay still b) may occur
c) has to occur
d) None of these b) process is interactive or batch
View Answer c) how long the process has computed
d) how much more long before its completion
Answer: a e) how many more resources the process needs
Explanation: None. before its completion
f) how many and what type of resources the process
Operating System Questions and has used
g) how many resources are available in the system
Answers – Deadlock Recovery h) All of these
View Answer
This set of 1000+ Operating System MCQs focuses
on “Deadlock Recovery” and will also be useful for Answer: a, b, c, d, e, f
interview preparations for experienced people. Explanation: None.
1) A deadlock can be broken by : (choose all that 5) Cost factors of process termination include :
apply) (choose all that apply)
a) abort one or more processes to break the circular a) number of resources the deadlock process is
wait holding
b) abort all the process in the system b) CPU utilization at the time of deadlock
c) preempt all resources from all processes c) amount of time a deadlocked process has thus far
d) to preempt some resources from one or more of consumed during its execution
the deadlocked processes d) All of the above
View Answer View Answer
Answer: a and d Answer: a and c
Explanation: None. Explanation: None.
2) The two ways of aborting processes and 6) If we preempt a resource from a process, the
eliminating deadlocks are : (choose all that apply) process cannot continue with its normal execution
a) Abort all deadlocked processes and it must be :
b) Abort all processes a) aborted
c) Abort one process at a time until the deadlock b) rolled back
cycle is eliminated c) terminated
d) All of these d) queued
View Answer View Answer
Answer: a and c Answer: b
Explanation: None. Explanation: None.
3) Those processes should be aborted on 7) To _______ to a safe state, the system needs to
occurrence of a deadlock, the termination of which : keep more information about the states of
a) is more time consuming processes.
b) incurs minimum cost a) abort the process
c) safety is not hampered b) roll back the process
d) All of these c) queue the process
View Answer d) None of these
View Answer
Answer: b
Explanation: None. Answer: b
Explanation: None.
4) The process to be aborted is chosen on the basis
of the following factors : (choose all that apply)
a) priority of the process
8) If the resources are always preempted from the 3. Which one of the following is the address
same process, __________ can occur. generated by CPU?
a) deadlock a) physical address
b) system crash b) absolute address
c) aging c) logical address
d) starvation d) none of the mentioned
View Answer View Answer

Answer: d Answer:c
Explanation: None. Explanation:None.

9) The solution to starvation is : 4. Run time mapping from virtual to physical

a) the number of rollbacks must be included in the address is done by
cost factor a) memory management unit
b) the number of resources must be included in b) CPU
resource preemption c) PCI
c) resource preemption be done instead d) none of the mentioned
d) All of these View Answer
View Answer
Answer:a
Answer: a Explanation:None.
Explanation: None.
5. Memory management technique in which system
stores and retrieves data from secondary storage for
Operating System Questions & use in main memory is called
Answers – Memory Management a) fragmentation
b) paging
This section of our 1000+ Operating System MCQs c) mapping
focuses on memory management of Operating d) none of the mentioned
System. View Answer

1. CPU fetches the instruction from memory Answer:b

according to the value of Explanation:None.
a) program counter
b) status register 6. The address of a page table in memory is pointed
c) instruction register by
d) program status word a) stack pointer
View Answer b) page table base register
c) page register
Answer:a d) program counter
Explanation:None. View Answer

2. A memory buffer used to accommodate a speed Answer:b

differential is called Explanation:None.
a) stack pointer
b) cache 7. Program always deals with
c) accumulator a) logical address
d) disk buffer b) absolute address
View Answer c) physical address
d) relative address
Answer:b View Answer
Explanation:None.
Answer:a 2) The operating system is :
Explanation:None. a) in the low memory
b) in the high memory
8. The page table contains c) either a or b (depending on the location of
a) base address of each page in physical memory interrupt vector)
b) page offset d) None of these
c) page size View Answer
d) none of the mentioned
View Answer Answer: c
Explanation: None.
Answer:a
Explanation:None. 3) In contiguous memory allocation :
a) each process is contained in a single contiguous
9. What is compaction? section of memory
a) a technique for overcoming internal fragmentation b) all processes are contained in a single contiguous
b) a paging technique section of memory
c) a technique for overcoming external c) the memory space is contiguous
fragmentation d) None of these
d) a technique for overcoming fatal error View Answer
View Answer
Answer: a
Answer:c Explanation: None.
Explanation:None.
4) The relocation register helps in :
10. Operating System maintains the page table for a) providing more address space to processes
a) each process b) a different address space to processes
b) each thread c) to protect the address spaces of processes
c) each instruction d) None of these
d) each address View Answer
View Answer
Answer: c
Answer:a Explanation: None.
Explanation:None.
5) With relocation and limit registers, each logical
address must be _______ the limit register.
Operating System Questions and a) less than
Answers – Memory Management b) equal to
– Memory Allocation – 1 c) greater than
d) None of these
This set of 1000+ Operating System MCQs focuses View Answer
on “Memory Management – Memory Allocation”
Answer: a
1) The main memory accommodates : Explanation: None.
a) operating system
b) CPU 6) The operating system and the other processes
c) user processes are protected from being modified by an already
d) All of these running process because :
View Answer a) they are in different memory spaces
b) they are in different logical addresses
Answer: a and c c) they have a protection algorithm
Explanation: None. d) every address generated by the CPU is being
checked against the relocation and limit registers c) free hole from a set of available holes
View Answer d) All of these
View Answer
Answer: d
Explanation: None. Answer: c
Explanation: None.
7) Transient operating system code is code that :
a) is not easily accessible
b) comes and goes as needed Operating System Questions and
c) stays in the memory always Answers – Memory Management
d) never enters the memory space
View Answer
– Memory Allocation – 1
This set of 1000+ Operating System MCQs focuses
Answer: b
on “Memory Management – Memory Allocation”
Explanation: None.
1) The main memory accommodates :
8) Using transient code, _______ the size of the
a) operating system
operating system during program execution.
b) CPU
a) increases
b) decreases c) user processes
d) All of these
c) changes
View Answer
d) maintains
View Answer Answer: a and c
Explanation: None.
Answer: c
Explanation: None. 2) The operating system is :
a) in the low memory
9) When memory is divided into several fixed sized
b) in the high memory
partitions, each partition may contain ________.
c) either a or b (depending on the location of
a) exactly one process
interrupt vector)
b) atleast one process
d) None of these
c) multiple processes at once
View Answer
d) None of these
View Answer Answer: c
Explanation: None.
Answer: a
Explanation: None. 3) In contiguous memory allocation :
a) each process is contained in a single contiguous
10) In fixed sized partition, the degree of
section of memory
multiprogramming is bounded by ___________.
b) all processes are contained in a single contiguous
a) the number of partitions
section of memory
b) the CPU utilization
c) the memory space is contiguous
c) the memory size
d) None of these
d) All of these
View Answer
View Answer
Answer: a
Answer: a
Explanation: None.
Explanation: None
4) The relocation register helps in :
11) The first fit, best fit and worst fit are strategies to
a) providing more address space to processes
select a ______.
b) a different address space to processes
a) process from a queue to put in memory
c) to protect the address spaces of processes
b) processor to run the next process
d) None of these a) exactly one process
View Answer b) atleast one process
c) multiple processes at once
Answer: c d) None of these
Explanation: None. View Answer
5) With relocation and limit registers, each logical Answer: a
address must be _______ the limit register. Explanation: None.
a) less than
b) equal to 10) In fixed sized partition, the degree of
c) greater than multiprogramming is bounded by ___________.
d) None of these a) the number of partitions
View Answer b) the CPU utilization
c) the memory size
Answer: a d) All of these
Explanation: None. View Answer
6) The operating system and the other processes Answer: a
are protected from being modified by an already Explanation: None
running process because :
a) they are in different memory spaces 11) The first fit, best fit and worst fit are strategies to
b) they are in different logical addresses select a ______.
c) they have a protection algorithm a) process from a queue to put in memory
d) every address generated by the CPU is being b) processor to run the next process
checked against the relocation and limit registers c) free hole from a set of available holes
View Answer d) All of these
View Answer
Answer: d
Explanation: None. Answer: c
Explanation: None.
7) Transient operating system code is code that :
a) is not easily accessible
b) comes and goes as needed Operating System Questions and
c) stays in the memory always Answers – Memory Management
d) never enters the memory space
View Answer
– Paging – 1
This set of 1000+ Operating System MCQs focuses
Answer: b
on “Memory Management – Paging”
Explanation: None.
1) Physical memory is broken into fixed-sized blocks
8) Using transient code, _______ the size of the
called ________.
operating system during program execution.
a) frames
a) increases
b) pages
b) decreases
c) backing store
c) changes
d) None of these
d) maintains
View Answer
View Answer
Answer: a
Answer: c
Explanation: None.
Explanation: None.
2) Logical memory is broken into blocks of the same
9) When memory is divided into several fixed sized
size called _________.
partitions, each partition may contain ________.
a) frames 7) If the size of logical address space is 2 to the
b) pages power of m, and a page size is 2 to the power of n
c) backing store addressing units, then the high order _____ bits of a
d) None of these logical address designate the page number, and the
View Answer ____ low order bits designate the page offset.
a) m, n
Answer: b b) n, m
Explanation: None. c) m – n, m
d) m – n, n
3) Every address generated by the CPU is divided
View Answer
into two parts : (choose two)
a) frame bit Answer: d
b) page number Explanation: None.
c) page offset
d) frame offset 8) With paging there is no ________ fragmentation.
View Answer a) internal
b) external
Answer: b and c c) either type of
Explanation: None. d) None of these
View Answer
4) The __________ is used as an index into the
page table. Answer: b
a) frame bit Explanation: None.
b) page number
c) page offset 9) The operating system maintains a ______ table
d) frame offset that keeps track of how many frames have been
View Answer allocated, how many are there, and how many are
available.
Answer: b a) page
Explanation: None. b) mapping
c) frame
5) The _____ table contains the base address of
d) memory
each page in physical memory.
View Answer
a) process
b) memory Answer: c
c) page Explanation: None.
d) frame
View Answer 10) Paging increases the ______ time.
a) waiting
Answer: c b) execution
Explanation: None. c) context – switch
d) All of these
6) The size of a page is typically :
View Answer
a) varied
b) power of 2 Answer: c
c) power of 4 Explanation: None.
d) None of these
View Answer 11) Smaller page tables are implemented as a set of
_______.
Answer: b a) queues
Explanation: None. b) stacks
c) counters
d) registers This set of 1000+ Operating System MCQs focuses
View Answer on “Memory Management – Paging”

Answer: d 1) Physical memory is broken into fixed-sized blocks

Explanation: None. called ________.
a) frames
12) The page table registers should be built with b) pages
_______. c) backing store
a) very low speed logic d) None of these
b) very high speed logic View Answer
c) a large memory space
d) None of these Answer: a
View Answer Explanation: None.

Answer: b 2) Logical memory is broken into blocks of the same

Explanation: None. size called _________.
a) frames
13) For larger page tables, they are kept in main b) pages
memory and a __________ points to the page table. c) backing store
a) page table base register d) None of these
b) page table base pointer View Answer
c) page table register pointer
d) page table base Answer: b
View Answer Explanation: None.

Answer: a 3) Every address generated by the CPU is divided

Explanation: None. into two parts : (choose two)
a) frame bit
14) For every process there is a __________. b) page number
a) page table c) page offset
b) copy of page table d) frame offset
c) pointer to page table View Answer
d) All of these
View Answer Answer: b and c
Explanation: None.
Answer: a
Explanation: None. 4) The __________ is used as an index into the
page table.
15) Time taken in memory access through PTBR is : a) frame bit
a) extended by a factor of 3 b) page number
b) extended by a factor of 2 c) page offset
c) slowed by a factor of 3 d) frame offset
d) slowed by a factor of 2 View Answer
View Answer
Answer: b
Answer: d Explanation: None.
Explanation: None.
5) The _____ table contains the base address of
each page in physical memory.
Operating System Questions and a) process
Answers – Memory Management b) memory
– Paging – 1 c) page
d) frame 10) Paging increases the ______ time.
View Answer a) waiting
b) execution
Answer: c c) context – switch
Explanation: None. d) All of these
View Answer
6) The size of a page is typically :
a) varied Answer: c
b) power of 2 Explanation: None.
c) power of 4
d) None of these 11) Smaller page tables are implemented as a set of
View Answer _______.
a) queues
Answer: b b) stacks
Explanation: None. c) counters
d) registers
7) If the size of logical address space is 2 to the
View Answer
power of m, and a page size is 2 to the power of n
addressing units, then the high order _____ bits of a Answer: d
logical address designate the page number, and the Explanation: None.
____ low order bits designate the page offset.
a) m, n 12) The page table registers should be built with
b) n, m _______.
c) m – n, m a) very low speed logic
d) m – n, n b) very high speed logic
View Answer c) a large memory space
d) None of these
Answer: d View Answer
Explanation: None.
Answer: b
8) With paging there is no ________ fragmentation. Explanation: None.
a) internal
b) external 13) For larger page tables, they are kept in main
c) either type of memory and a __________ points to the page table.
d) None of these a) page table base register
View Answer b) page table base pointer
c) page table register pointer
Answer: b d) page table base
Explanation: None. View Answer
9) The operating system maintains a ______ table Answer: a
that keeps track of how many frames have been Explanation: None.
allocated, how many are there, and how many are
available. 14) For every process there is a __________.
a) page a) page table
b) mapping b) copy of page table
c) frame c) pointer to page table
d) memory d) All of these
View Answer View Answer

Answer: c Answer: a
Explanation: None. Explanation: None.
15) Time taken in memory access through PTBR is : b) starting physical address of the segment in
a) extended by a factor of 3 memory
b) extended by a factor of 2 c) segment length
c) slowed by a factor of 3 d) None of these
d) slowed by a factor of 2 View Answer
View Answer
Answer: b
Answer: d Explanation: None.
Explanation: None.
5) The segment limit contains the :
a) starting logical address of the process
Operating System Questions and b) starting physical address of the segment in
Answers – Memory Management memory
c) segment length
– Segmentation d) None of these
This set of 1000+ Operating System MCQs focuses View Answer
on “Memory Management – Segmentation” Answer: c
1) In segmentation, each address is specified by : Explanation: None.
a) a segment number 6) The offset ‘d’ of the logical address must be :
b) an offset a) greater than segment limit
c) a value b) between 0 and segment limit
d) a key c) between 0 and the segment number
View Answer d) greater than the segment number
Answer: a and b View Answer
Explanation: None. Answer: b
2) In paging the user provides only ________, which Explanation: None.
is partitioned by the hardware into ________ and 7) If the offset is legal :
______. a) it is used as a physical memory address itself
a) one address, page number, offset b) it is subtracted from the segment base to produce
b) one offset, page number, address the physical memory address
c) page number, offset, address c) it is added to the segment base to produce the
d) None of these physical memory address
View Answer d) None of these
Answer: a View Answer
Explanation: None. Answer: a
3) Each entry in a segment table has a : Explanation: None.
a) segment base 8) When the entries in the segment tables of two
b) segment peak different processes point to the same physical
c) segment limit location :
d) segment value a) the segments are invalid
View Answer b) the processes get blocked
Answer: a and c c) segments are shared
Explanation: None. d) All of these
View Answer
4) The segment base contains the :
a) starting logical address of the process Answer: c
Explanation: None.
9) The protection bit is 0/1 based on : (choose all Answer: b
that apply) Explanation: None.
a) write only
b) read only
c) read – write Operating System Questions and
d) None of these Answers – Memory Management
View Answer – Segmentation
Answer: b and c This set of 1000+ Operating System MCQs focuses
Explanation: None. on “Memory Management – Segmentation”
10) If there are 32 segments, each of size 1Kb, then 1) In segmentation, each address is specified by :
the logical address should have : a) a segment number
a) 13 bits b) an offset
b) 14 bits c) a value
c) 15 bits d) a key
d) 16 bits View Answer
View Answer
Answer: a and b
Answer: a Explanation: None.
Explanation: To specify a particular segment, 5 bits
are required. To select a particular byte after 2) In paging the user provides only ________, which
selecting a page, 10 more bits are required. Hence is partitioned by the hardware into ________ and
15 bits are required. ______.
a) one address, page number, offset
11) Consider a computer with 8 Mbytes of main b) one offset, page number, address
memory and a 128 K cache. The cache block size is c) page number, offset, address
4 K. It uses a direct mapping scheme for cache d) None of these
management. How many different main memory View Answer
blocks can map onto a given physical cache block ?
a) 2048 Answer: a
b) 256 Explanation: None.
c) 64
d) 8 3) Each entry in a segment table has a :
View Answer a) segment base
b) segment peak
Answer: c c) segment limit
Explanation: None. d) segment value
View Answer
12) A multilevel page table is preferred in
comparison to a single level page table for Answer: a and c
translating virtual address to physical address Explanation: None.
because :
a) it reduces the memory access time to read or 4) The segment base contains the :
write a memory location a) starting logical address of the process
b) it helps to reduce the size of page table needed b) starting physical address of the segment in
to implement the virtual address space of a process memory
c) it is required by the translation look aside buffer c) segment length
d) it helps to reduce the number of page faults in d) None of these
page replacement algorithms View Answer
View Answer
Answer: b d) None of these
Explanation: None. View Answer

5) The segment limit contains the : Answer: b and c

a) starting logical address of the process Explanation: None.
b) starting physical address of the segment in
memory 10) If there are 32 segments, each of size 1Kb, then
c) segment length the logical address should have :
d) None of these a) 13 bits
View Answer b) 14 bits
c) 15 bits
Answer: c d) 16 bits
Explanation: None. View Answer

6) The offset ‘d’ of the logical address must be : Answer: a

a) greater than segment limit Explanation: To specify a particular segment, 5 bits
b) between 0 and segment limit are required. To select a particular byte after
c) between 0 and the segment number selecting a page, 10 more bits are required. Hence
d) greater than the segment number 15 bits are required.
View Answer
11) Consider a computer with 8 Mbytes of main
Answer: b memory and a 128 K cache. The cache block size is
Explanation: None. 4 K. It uses a direct mapping scheme for cache
management. How many different main memory
7) If the offset is legal : blocks can map onto a given physical cache block ?
a) it is used as a physical memory address itself a) 2048
b) it is subtracted from the segment base to produce b) 256
the physical memory address c) 64
c) it is added to the segment base to produce the d) 8
physical memory address View Answer
d) None of these
View Answer Answer: c
Explanation: None.
Answer: a
Explanation: None. 12) A multilevel page table is preferred in
comparison to a single level page table for
8) When the entries in the segment tables of two translating virtual address to physical address
different processes point to the same physical because :
location : a) it reduces the memory access time to read or
a) the segments are invalid write a memory location
b) the processes get blocked b) it helps to reduce the size of page table needed
c) segments are shared to implement the virtual address space of a process
d) All of these c) it is required by the translation look aside buffer
View Answer d) it helps to reduce the number of page faults in
page replacement algorithms
Answer: c
View Answer
Explanation: None.
Answer: b
9) The protection bit is 0/1 based on : (choose all
Explanation: None.
that apply)
a) write only
b) read only
c) read – write
Operating System Questions & 5) The hybrid algorithm that combines EDF with
SCAN algorithm is known as :
Answers – Multimedia System – a) EDS
CPU and Disk Scheduling b) SDF
c) SCAN-EDF
This set of 1000+ Operating System MCQs focuses d) None of these
on “Multimedia System – CPU and Disk Scheduling” View Answer
1) A scheduling algorithm can use either Answer : c
___________ priority or ________ priority. Explanation: None
a) static, still
b) static, dynamic 6) If several requests have different deadlines that
c) live, dead are relaticely close together, then using the SCAN –
d) None of these EDF algorithm :
View Answer a) the SCAN ordering will service the requests in
that batch
Answer : b b) the EDF ordering will service the requests in that
Explanation: None batch
c) the FCFS ordering will service the requests in that
2) The priority of a process will ______________ if
batch
the scheduler assigns it a static priority.
d) None of these
a) change
View Answer
b) remain unchanged
c) depends on the operating system Answer : a
d) None of these Explanation: None
View Answer
7) Multimedia systems require _________
Answer : b scheduling to ensure critical tasks will be serviced
Explanation: None within timing deadlines.
a) soft real time
3) As disks have relatively low transfer rates and
b) hard real time
relatively high latency rates, disk schedulers must
c) normal
reduce latency times to :
d) None of these
a) ensure high bandwidth
View Answer
b) ensure low bandwidth
c) make sure data is transferred Answer : b
d) reduce data transfer speeds Explanation: None
View Answer
8) The EDF scheduler uses ________ to order
Answer : a requests according to their deadlines.
Explanation: None a) stack
b) disks
4) Servicing requests strictly according to deadline
c) queue
using EDF may result in :
d) None of these
a) lower seek times
View Answer
b) lower bandwidth
c) higher seek time Answer : c
d) higher bandwidth Explanation: None
View Answer
9) In SCAN – EDF, requests with the same
Answer : c deadlines are ordered according to :
Explanation: None a) SCAN policy
b) EDF policy Answer : c and d
c) FCFS policy Explanation: None.
d) FIFO policy
View Answer 5) The ________ keeps state information about the
use of I/O components.
Answer : a a) CPU
Explanation: None b) OS
c) kernel
d) shell
Operating System Questions & View Answer
Answers – I/O System – Kernel
Answer : c
I/O Subsystems Explanation: None.
This set of 1000+ Operating System MCQs focuses 6) The kernel data structures include :
on “Kernel I/O Subsystems” a) process table
1) Buffering is done to : b) open file table
a) cope with device speed mismatch c) close file table
b) cope with device transfer size mismatch d) All of these
c) maintain copy semantics View Answer
d) All of these Answer : b
View Answer Explanation: None.
Answer : d 7) Windows NT uses a __________ implementation
Explanation: None. for I/O
2) Caching is ________ spooling. a) message – passing
a) same as b) draft – passing
b) not the same as c) secondary memory
c) None of these d) cache
View Answer View Answer

Answer : b Answer : a
Explanation: None. Explanation: None.

3) Caching : (choose all that apply) 8) A ________ is a full duplex connection between a
a) holds a copy of the data device driver and a user level process.
b) is fast memory a) bus
c) holds the only copy of the data b) I/O operation
d) holds output for a device c) stream
View Answer d) flow
View Answer
Answer : a and b
Explanation: None. Answer : c
Explanation: None.
4) Spooling : (choose all that apply)
a) holds a copy of the data 9) I/O is a _________ in system performance.
b) is fast memory a) major factor
c) holds the only copy of the data b) minor factor
d) holds output for a device c) does not matter
View Answer d) None of these
View Answer
Answer : a d) dependent on the scheduling
Explanation: None. View Answer

10) If the number of cycles spent busy – waiting is Answer:a

not excessive, then : Explanation:Interrupt latency is the time duration
a) interrupt driven I/O is more efficient than between the generation of interrupt and execution of
programmed I/O its service.
b) programmed I/O is more efficient than interrupt
driven I/O 4. In rate monotonic scheduling
c) Both programmed and interrupt driven I/O are a) shorter duration job has higher priority
equally efficient b) longer duration job has higher priority
d) None of these c) priority does not depend on the duration of the job
View Answer d) none of the mentioned
View Answer
Answer : b
Explanation: None. Answer:a
Explanation:None.

Operating System Questions & 5. In which scheduling certain amount of CPU time
is allocated to each process?
Answers – RTOS a) earliest deadline first scheduling
This section of our 1000+ Operating System MCQs b) proportional share scheduling
focuses on Real Time Operating System. c) equal share scheduling
d) none of the mentioned
1. In real time operating system View Answer
a) all processes have the same priority
b) a task must be serviced by its deadline period Answer:b
c) process scheduling can be done only once Explanation:None.
d) kernel is not required 6. The problem of priority inversion can be solved by
View Answer a) priority inheritance protocol
Answer:b b) priority inversion protocol
Explanation:None. c) both (a) and (b)
d) none of the mentioned
2. Hard real time operating system has ___ jitter View Answer
than a soft real time operating system.
a) less Answer:a
b) more Explanation:None.
c) equal 7. Time duration required for scheduling dispatcher
d) none of the mentioned to stop one process and start another is known as
View Answer a) process latency
Answer:a b) dispatch latency
Explanation:Jitter is the undesired deviation from the c) execution latency
true periodicity. d) interrupt latency
View Answer
3. For real time operating systems, interrupt latency
should be Answer:b
a) minimal Explanation:None.
b) maximum 8. Time required to synchronous switch from the
c) zero context of one thread to the context of another
thread is called
a) threads fly-back time c) 0.94
b) jitter d) 0.80
c) context switch time View Answer
d) none of the mentioned
View Answer Answer : c
Explanation: None.
Answer:c
Explanation:None. 3) In the above question, the priorities of P1 and
P2 :
9. Which one of the following is a real time operating a) remain the same throughout
system? b) keep varying from time to time
a) RTLinux c) None of these
b) VxWorks View Answer
c) windows CE
d) all of the mentioned Answer : b
View Answer Explanation: None.

Answer:d 4) In Question number 2, can the two processes be

Explanation:None. scheduled using the EDF algorithm without missing
their respective deadlines ?
10. VxWorks is centered around a) Yes
a) wind microkernel b) No
b) linux kernel c) Maybe
c) unix kernel View Answer
d) none of the mentioned
View Answer Answer : a
Explanation: None.
Answer:a
Explanation:None. 5) Using EDF algorithm practically, it is impossible
to achieve 100 percent utilization due to : (choose
all that apply)
Operating System Questions & a) the cost of context switching
Answers – Real Time System – b) interrupt handling
c) power consumption
Real Time CPU Scheduling – 1 d) All of these
This set of 1000+ Operating System MCQs focuses View Answer
on “Real Time System – Real Time CPU Answer : a and b
Scheduling” Explanation: None.
1) Earliest deadline first algorithm assigns priorities 6) T shares of time are allocated among all
according to : processes out of N shares in __________
a) periods scheduling algorithm.
b) deadlines a) rate monotonic
c) burst times b) proportional share
d) None of these c) earliest deadline first
View Answer d) None of these
2) A process P1 has a period of 50 and a CPU burst View Answer
of t1 = 25, P2 has a period of 80 and a CPU burst of Answer : b
35. The total CPU utilization is : Explanation: None.
a) 0.90
b) 0.74
7) If there are a total of T = 100 shares to be divided This section of our 1000+ Operating System MCQs
among three processes, A, B and C. A is assigned focuses on distributed Operating System.
50 shares, B is assigned 15 shares and C is
assigned 20 shares. 1. In distributed system each processor has its own
i) A will have ______ percent of the total processor a) local memory
time. b) clock
a) 20 c) both (a) and (b)
b) 15 d) none of the mentioned
c) 50 View Answer
d) None of these Answer:c
View Answer Explanation:None.
Answer : c 2. If one site fails in distributed system
Explanation: None. a) the remaining sites can continue operating
ii) B will have ______ percent of the total processor b) all the sites will stop working
time. c) directly connected sites will stop working
a) 20 d) none of the mentioned
b) 15 View Answer
c) 50 Answer:a
d) None of these Explanation:None.
View Answer
3. Network operating system runs on
Answer : b a) server
Explanation: None. b) every system in the network
iii) C will have ______ percent of the total processor c) both (a) and (b)
time. d) none of the mentioned
a) 20 View Answer
b) 15 Answer:a
c) 50 Explanation:None.
d) None of these
View Answer 4. Which technique is based on compile-time
program transformation for accessing remote data in
Answer : a a distributed-memory parallel system.
Explanation: None.
a) cache coherence scheme
iv) If a new process D requested 30 shares, the b) computation migration
admission controller would : c) remote procedure call
a) allocate 30 shares to it d) message passing
b) deny entry to D in the system View Answer
c) None of these Answer:b
View Answer Explanation:None.
Answer : b 5. Logical extension of computation migration is
Explanation: None. a) process migration
b) system migration
Operating System Questions & c) thread migration
d) data migration
Answers – Distributed Operating View Answer
System
Answer:a Answer:a
Explanation:None. Explanation:None.

6. Processes on the remote systems are identified

by Operating System Questions &
a) host ID Answers – Distributed Operating
b) host name and identifier
c) identifier
System – Types & Resource
d) process ID Sharing
View Answer
This set of 1000+ Operating System MCQs focuses
Answer:b on “Distributed Operating System – Types &
Explanation:None. Resource Sharing”

7. Which routing technique is used in distributed 1) What is not true about distributed system ?
system? a) It is a collection of processor
a) fixed routing b) All processors are synchronized
b) virtual routing c) They do not share memory
c) dynamic routing d) None of these
d) all of the mentioned View Answer
View Answer
Answer : b
Answer:d Explanation: None.
Explanation:None.
2) What are characteristics of processor in
8. In distributed systems, link and site failure is distributed system ?
detected by a) They vary in size and function
a) polling b) They are same in size and function
b) handshaking c) They are manufactured with single purpose
c) token passing d) They are real-time devices
d) none of the mentioned View Answer
View Answer
Answer : a
Answer:b Explanation: None.
Explanation:None.
3) What are characteristics of distributed file
9. The capability of a system to adapt the increased system ? (Choose two)
service load is called a) Its users,servers and storage devices are
a) scalability dispersed
b) tolerance b) Service activity is carried out across the network
c) capacity c) They have single centralized data repository
d) none of the mentioned d) There are multiple dependent storage devices
View Answer View Answer

Answer:a Answer : a & b

Explanation:None. Explanation: None.

10. Internet provides _______ for remote login. 4) What is not a major reason for building distributed
a) telnet systems ?
b) http a) Resource sharing
c) ftp b) Computation speedup
d) RPC c) Reliability
View Answer
d) Simplicity b) transfer the computation rather than the data
View Answer c) execute an entire process or parts of it at different
sites
Answer : d d) None of these
Explanation: None. View Answer
5) What are two types of distributed operating Answer : a
system ? (Choose two) Explanation: None.
a) Network Operating system
b) Zone based Operating system 10) What are characteristics of computation
c) Level based Operating system migration ?
d) Distributed Operating system a) transfer data by entire file or immediate portion
View Answer required
b) transfer the computation rather than the data
Answer : a & d c) execute an entire process or parts of it at different
Explanation: None. sites
d) None of these
6) What are characteristic of Network Operating
View Answer
Systems ? (Choose two)
a) Users are aware of multiplicity of machines Answer : b
b) They are transparent Explanation: None.
c) They are simple to use
d) They are not transparent 11) What are characteristics of process migration ?
View Answer a) transfer data by entire file or immediate portion
required
Answer : a & d b) transfer the computation rather than the data
Explanation: None. c) execute an entire process or parts of it at different
sites
7) How are access to resources of various machines
d) None of these
is done ? (Choose two)
View Answer
a) Remote logging using ssh or telnet
b) Remote Desktop Answer : c
c) FTP is not used Explanation: None.
d) Zone are configured for automatic access
View Answer
Operating System Questions &
Answer : a & b
Explanation: None.
Answers – Distributed Operating
System – Network Structure &
8) What are characteristics of Distributed Operating
system ? (Choose two)
Topology
a) Users are not aware of multiplicity of machines This set of 1000+ Operating System MCQs focuses
b) Access is done like local resources on “Distributed Operating System – Network
c) Users are aware of multiplicity of machines Structure & Topology”
d) They have multiple zones to access files
View Answer 1) What are parts of network structure ? (Choose
three)
Answer : a & b a) Workstation
Explanation: None. b) Gateway
c) Laptop
9) What are characteristics of data migration ?
d) Mouse
a) transfer data by entire file or immediate portion
View Answer
required
Answer : a,b & c Answer : a,c & d
Explanation: None. Explanation: None.

2) What are valid network topology ? (Choose three) 7) What are connection strategies used in
a) Multiaccess bus distributed systems ? (Choose three)
b) ring a) Circuit switching
c) star b) Message switching
d) mesh c) Token switching
View Answer d) Packet switching
View Answer
Answer : a,b & c
Explanation: None. Answer : a,b & d
Explanation: None.
3) What are sites in network topology compared ?
(Choose three) 8) How is are collisions avoided in network ?
a) Basic cost (Choose three)
b) Communication cost a) Carrier sense with multiple access (CSMA);
c) Flexibility collision detection (CD)
d) Reliability b) Carrier sense multiple access with collision
View Answer avoidance
c) Token Passing
Answer : a,b & d d) Message slots
Explanation: None. View Answer
4) Which design features of a communication Answer : a,b & d
network are important ? (Choose three) Explanation: None.
a) Naming and name resolution
b) Routing strategies 9) What is common problem found in distributed
c) Connection strategies system ?
d) Minimum number of devices a) Process Synchronization
View Answer b) Communication synchronization
c) Deadlock problem
Answer : a,b & c d) Power failure
Explanation: None. View Answer
5) What are characteristics of Naming and Name Answer : c
resolution ? (Choose two) Explanation: None.
a) Name systems in the network
b) address messages with the process-id
c) virtual circuit
d) message switching
View Answer

Answer : a & b
Explanation: None.

6) What are routing strategies used in distributed

systems ? (Choose three)
a) Fixed routing
b) Token routing
c) Virtual circuit
d) Dynamic routing
View Answer