Operating System important questions by Infee Ma’am

Join us at:
Youtube:- https://www.youtube.com/@infeepedia
Facebook group:- facebook.com/groups/infeetripathi/?ref=share’
Telegram group:- t.me/ xCW17MS0Hn41NDI9
Telegram channel:- t.me/infeepedia1
Instagram:- https://www.instagram.com/infeepedia/
Whatsapp channel:- https://whatsapp.com/channel/0029Va9TFe6DOQIfuYcVeY0g
Twitter:- https://twitter.com/infeepedia
 Operating System important questions by Infee Ma’am
1. What is an operating system?
a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) interface between the hardware and application programs
d) all of the mentioned
2. The initial program that is run when the computer is powered up is called __________
a) boot program
b) bootloader
c) initializer
d) bootstrap program

3. Which one of the following is not true?

a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which can not be loaded in running operating system
d) kernel remains in the memory during the entire computer session
4. Which one of the following error will be handle by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
d) all of the mentioned
5. What is the main function of the command interpreter?
a) to get and execute the next user-specified command
b) to provide the interface between the API and application program
c) to handle the files in operating system
d) none of the mentioned
6. In Operating Systems, which of the following is/are CPU scheduling algorithms?
 Operating System important questions by Infee Ma’am
a) Round Robin
b) Shortest Job First
c) Priority
d) All of the mentioned
7. If a process fails, most operating system write the error information to a ______.
a) log file
b) another running process
c) new file
d) none of the mentioned
8. Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
a) DTrace
b) DLocate
c) DMap
d) DAdd
9. In operating system, each process has its own __________.
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
10. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
11. A process can be terminated due to __________
a) normal exit
b) fatal error
 Operating System important questions by Infee Ma’am
c) killed by another process
d) all of the mentioned
12. What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned
13. What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
14. A set of processes is deadlock if __________.
a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned
15. Which system call can be used by a parent process to determine the termination of child process?
a) wait
b) exit
c) fork
d) get
16. A Process Control Block(PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
 Operating System important questions by Infee Ma’am
d) Data
17. The number of processes completed per unit time is known as ________.
a) Output
b) Throughput
c) Efficiency
d) Capacity
18. The state of a process is defined by ________.
a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
19. Which of the following is not the state of a process?
a) New
b) Old
c) Waiting
d) Running
20. What is a Process Control Block?
a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
21. The entry of all the PCBs of the current processes is in ______.
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
22. What is the degree of multiprogramming?
 Operating System important questions by Infee Ma’am
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory
23. A single thread of control allows the process to perform _____.
a) only one task at a time
b) multiple tasks at a time
c) only two tasks at a time
d) all of the mentioned
24. Which of the following do not belong to queues for processes?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
25. What is a long-term scheduler?
a) It selects processes which have to be brought into the ready queue
b) It selects processes which have to be executed next and allocates CPU
c) It selects processes which heave to remove from memory by swapping
d) None of the mentioned
26. If all processes I/O bound, the ready queue will almost always be ____and the Short term Scheduler will have a ____ to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot
27. What is a medium-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
 Operating System important questions by Infee Ma’am
c) It selects which process to remove from memory by swapping
d) None of the mentioned
28. What is a short-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
29. The only state transition that is initiated by the user process itself is __________.
a) block
b) wakeup
c) dispatch
d) none of the mentioned
30. In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the __________.
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state
31. In a multiprogramming environment __________.
a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time
32. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the _______.
a) Running state
b) Ready state
c) Suspended state
d) Terminated state
 Operating System important questions by Infee Ma’am
33. The context of a process in the PCB of a process does not contain _________.
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time
34. Which process can be affected by other processes executing in the system?
a) cooperating process
b) child process
c) parent process
d) init process
35. When several processes access the same data concurrently and the outcome of the execution depends on the particular order i n which the access takes
place is called ________.
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
36. If a process is executing in its critical section, then no other processes can be executing in their critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
37. Which one of the following is a synchronization tool?
a) thread
b) pipe
c) semaphore
d) socket
38. A semaphore is a shared integer variable __________.
 Operating System important questions by Infee Ma’am
a) that can not drop below zero
b) that can not be more than zero
c) that can not drop below one
d) that can not be more than one
39. When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called
__________
a) priority inversion
b) priority removal
c) priority exchange
d) priority modification
40. Restricting the child process to a subset of the parent’s resources prevents any process from __________.
a) overloading the system by using a lot of secondary storage
b) under-loading the system by very less CPU utilization
c) overloading the system by creating a lot of sub-processes
d) crashing the system by utilizing multiple resources
41. Cascading termination refers to termination of all child processes if the parent process terminates ______.
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of the mentioned
42. With _____________ only one process can execute at a time; meanwhile all other process are waiting for the processor. With ______________ more
than one process can be running simultaneously each on a different processor.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing
43. In UNIX, the return value for the fork system call is _____ for the child process and _____ for the parent process.
 Operating System important questions by Infee Ma’am
a) A Negative integer, Zero
b) Zero, A Negative integer
c) Zero, A nonzero integer
d) A nonzero integer, Zero
44. The child process completes execution, but the parent keeps executing, then the child process is known as __________.
a) Orphan
b) Zombie
c) Body
d) Dead
45. What is Interprocess communication?
a) allows processes to communicate and synchronize their actions when using the same address space
b) allows processes to communicate and synchronize their actions
c) allows the processes to only synchronize their actions without communication
d) none of the mentioned
46. Message passing system allows processes to __________.
a) communicate with each other without sharing the same address space
b) communicate with one another by resorting to shared data
c) share data
d) name the recipient or sender of the message
47. Remote Procedure Calls are used ____________.
a) for communication between two processes remotely different from each other on the same system
b) for communication between two processes on the same system
c) for communication between two processes on separate systems
d) none of the mentioned
48. To access the services of operating system, the interface is provided by the ___________.
a) System calls
b) API
 Operating System important questions by Infee Ma’am
c) Library
d) Assembly instructions

49. How does the software trigger an interrupt?

a) Sending signals to CPU through bus
b) Executing a special operation called system call
c) Executing a special program called system program
d) Executing a special program called interrupt trigger program
50. How does the Hardware trigger an interrupt?
a) Sending signals to CPU through a system bus
b) Executing a special program called interrupt program
c) Executing a special program called system program
d) Executing a special operation called system call

51. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned

52. The interval from the time of submission of a process to the time of completion is termed as ________.
a) waiting time
b) turnaround time
c) response time
d) throughput
53. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
 Operating System important questions by Infee Ma’am
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

54. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process

55. Which algorithm is defined in Time quantum?

a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

56. Process are classified into different groups in ____________

a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

57. In multilevel feedback scheduling algorithm ____________

a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
 Operating System important questions by Infee Ma’am
d) none of the mentioned

58. CPU scheduling is the basis of ___________.

a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) none of the mentioned

59. What are the two steps of a process execution?

a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst
60. A process is selected from the ______ queue by the ______ scheduler, to be executed.
a) blocked, short term
b) wait, long term
c) ready, short term
d) ready, long term

61. In the following cases non – preemptive scheduling occurs?

a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
d) All of the mentioned

62. What is Dispatch latency?

a) the speed of dispatching a process from running to the ready state
 Operating System important questions by Infee Ma’am
b) the time of dispatching a process from running to ready state and keeping the CPU idle
c) the time to stop one process and start running another one
d) none of the mentioned

63. Scheduling is done so as to ____________.

a) increase the throughput
b) increase CPU utilization
c) reduce the duration of a specific amount of work d) decrease the turnaround time
e) None of the above f) More than one of the above
64. What is Turnaround time?
a) the total waiting time for a process to finish execution
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

65. Round robin scheduling falls under the category of _______.

a) Non-preemptive scheduling
b) Preemptive scheduling
c) All of the mentioned
d) None of the mentioned

66. With round robin scheduling algorithm in a time shared system ______.
a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
67. The strategy of making processes that are logically runnable to be temporarily suspended is called _________.
 Operating System important questions by Infee Ma’am
a) Non preemptive scheduling
b) Preemptive scheduling
c) Shortest job first
d) First come First served

68. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly _____.
a) Lengthened; Shortened
b) Shortened; Lengthened
c) Shortened; Shortened
d) Shortened; Unchanged

69. Which of the following statements are true? I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause
starvationIII. Round robin is better than FCFS in terms of response time a) I only
b) I and III only
c) II and III only
d) I, II and III
70. The real difficulty with SJF in short term scheduling is ______.
a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
d) none of the mentioned
 Operating System important questions by Infee Ma’am
71. The FCFS algorithm is particularly troublesome for _____.
a) time sharing systems
b) multiprogramming systems
c) multiprocessor systems
d) operating systems
72. An SJF algorithm is simply a priority algorithm where the priority is ________.
a) the predicted next CPU burst
b) the inverse of the predicted next CPU burst
c) the current CPU burst
d) anything the user wants
73. What is ‘Aging’?
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 referenced
d) increasing the priority of jobs to ensure termination in a finite time

74. A solution to the problem of indefinite blockage of low – priority processes is _________.
a) Starvation
b) Wait queue
c) Ready queue
d) Aging

75. The segment of code in which the process may change common variables, update tables, write into files is known as _______.
a) program
b) critical section
c) non – critical section
d) synchronizing
 Operating System important questions by Infee Ma’am
76. Which of the following conditions must be satisfied to solve the critical section problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned

78. Mutual exclusion implies that ____________.

a) if a process is executing in its critical section, then no other process must be executing in their critical sections
b) if a process is executing in its critical section, then other processes must be executing in their critical sections
c) if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
d) none of the mentioned
78. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter i ts critical section _________.
a) after a process has made a request to enter its critical section and before the request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) none of the mentioned
79. An un-interruptible unit is known as _________.
a) single
b) atomic
c) static
d) none of the mentioned

80. What are the two atomic operations permissible on semaphores?

a) wait
b) stop
c) hold
 Operating System important questions by Infee Ma’am
d) none of the mentioned

81. What are Spinlocks?

a) CPU cycles wasting locks over critical sections of programs
b) Locks that avoid time wastage in context switches
c) Locks that work better on multiprocessor systems
d) All of the mentioned

82. What is the main disadvantage of spinlocks?

a) they are not sufficient for many process
b) they require busy waiting
c) they are unreliable sometimes
d) they are too complex for programmers

83. The wait operation of the semaphore basically works on the basic _______ system call.
a) stop()
b) block()
c) hold()
d) wait()

84. The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()

85. If the semaphore value is negative ________.

 Operating System important questions by Infee Ma’am
a) its magnitude is the number of processes waiting on that semaphore
b) it is invalid
c) no operation can be further performed on it until the signal operation is performed on it
d) none of the mentioned

86. What will happen if a non-recursive mutex is locked more than once?
a) Starvation
b) Deadlock
c) Aging
d) Signaling
87. Semaphores are mostly used to implement __________.
a) System calls
b) IPC mechanisms
c) System protection
d) None of the mentioned
88. The bounded buffer problem is also known as _______.
a) Readers – Writers problem
b) Dining – Philosophers problem
c) Producer – Consumer problem
d) None of the mentioned

89. To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.
a) readers
b) writers
c) readers and writers
d) none of the mentioned
 Operating System important questions by Infee Ma’am
90. The dining – philosophers problem will occur in case of ______.
a) 5 philosophers and 5 chopsticks
b) 4 philosophers and 5 chopsticks
c) 3 philosophers and 5 chopsticks
d) 6 philosophers and 5 chopsticks

91. A deadlock free solution to the dining philosophers problem ________.

a) necessarily eliminates the possibility of starvation
b) does not necessarily eliminate the possibility of starvation
c) eliminates any possibility of any kind of problem further
d) none of the mentioned

1. A monitor is a type of ____________.

a) semaphore
b) low level synchronization construct
c) high level synchronization construct
d) none of the mentioned

93. A monitor is characterized by ___________.

a) a set of programmer defined operators
b) an identifier
c) the number of variables in it
d) all of the mentioned

94. Which is the process of invoking the wait operation?

a) suspended until another process invokes the signal operation
b) waiting for another process to complete before it can itself call the signal operation
 Operating System important questions by Infee Ma’am
c) stopped until the next process in the queue finishes execution
d) none of the mentioned

95. If no process is suspended, the signal operation _________.

a) puts the system into a deadlock state
b) suspends some default process execution
c) nothing happens
d) the output is unpredictable
96. A terminated transaction that has completed its execution successfully is ____________ otherwise it is _________.
a) committed, destroyed
b) aborted, destroyed
c) committed, aborted
d) none of the mentioned

97. A locking protocol is one that ___________.

a) governs how locks are acquired
b) governs how locks are released
c) governs how locks are acquired and released
d) none of the mentioned

98. The two phase locking protocol consists of __________.

a) growing & shrinking phase
b) shrinking & creation phase
c) creation & growing phase
d) destruction & creation phase

99. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
 Operating System important questions by Infee Ma’am
I) 2-phase locking
II) Timestamp ordering a) I only
b) II only
c) Both I and II
d) Neither I nor II

100. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
 Operating System important questions by Infee Ma’am
101. Which of the following condition is required for a deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources.
c) no resource can be forcibly removed from a process holding it.
d) all of the mentioned

102. A system is in the safe state if ____________.

a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

103. The circular wait condition can be prevented by ____________

a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned

104. Which one of the following is the deadlock avoidance algorithm?

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

105. A problem encountered in multitasking when a process is perpetually denied necessary resources is called __________.
a) deadlock
b) starvation
 Operating System important questions by Infee Ma’am
c) inversion
d) aging

106. To avoid deadlock ____________.

a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used

107. The number of resources requested by a process _______.

a) must always be less than the total number of resources available in the system
b) must always be equal to the total number of resources available in the system
c) must not exceed the total number of resources available in the system
d) must exceed the total number of resources available in the system
108. What are Multithreaded programs?
a) lesser prone to deadlocks
b) more prone to deadlocks
c) not at all prone to deadlocks
d) none of the mentioned
109. For a deadlock to arise, which of the following conditions must hold simultaneously?
a) Mutual exclusion
b) No preemption
c) Hold and wait
d) All of the mentioned

110. For Mutual exclusion to prevail in the system ___________.

a) at least one resource must be held in a non sharable mode
 Operating System important questions by Infee Ma’am
b) the processor must be a uniprocessor rather than a multiprocessor
c) there must be at least one resource in a sharable mode
d) all of the mentioned

111. For a Hold and wait condition to prevail _________.

a) A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
b) A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
c) A process must hold at least one resource and not be waiting to acquire additional resources
d) None of the mentioned
112. Deadlock prevention is a set of methods __________. a) to ensure that at least one of the necessary conditions cannot hold
b) to ensure that all of the necessary conditions do not hold
c) to decide if the requested resources for a process have to be given or not
d) to recover from a deadlock

113. For non sharable resources like a printer, mutual exclusion ________.
a) must exist
b) must not exist
c) may exist
d) none of the mentioned
114. For sharable resources, mutual exclusion _________.
a) is required
b) is not required
c) may be or may not be required
d) none of the mentioned
 Operating System important questions by Infee Ma’am
115. To ensure that the hold and wait condition never occurs in the system, it must be ensured that _________.
a) whenever a resource is requested by a process, it is not holding any other resources
b) each process must request and be allocated all its resources before it begins its execution
c) a process can request resources only when it has none
d) all of the mentioned
116. The disadvantage of a process being allocated all its resources before beginning its execution is ________.
a) Low CPU utilization
b) Low resource utilization
c) Very high resource utilization
d) None of the mentioned

117. To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately al located to it _________.
a) then the process waits for the resources be allocated to it
b) the process keeps sending requests until the resource is allocated to it
c) the process resumes execution without the resource being allocated to it
d) then all resources currently being held are preempted
118. One way to ensure that the circular wait condition never holds is to _________.
a) impose a total ordering of all resource types and to determine whether one precedes another in the ordering
b) to never let a process acquire resources that are held by other processes
c) to let a process wait for only one resource at a time
d) all of the mentioned
119. Each request requires that the system consider the ______ to decide whether the current request can be satisfied or must wait to avoid a future
possible deadlock.
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process
 Operating System important questions by Infee Ma’am
120. Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an
algorithm that ensures that the system will never enter a deadlock state.
a) minimum
b) average
c) maximum
d) approximate

121. A deadlock avoidance algorithm dynamically examines the ________ to ensure that a circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources
122. A state is safe, if __________
a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and still avoid a deadlock
c) the state keeps the system protected and safe
d) all of the mentioned
123. A system is in a safe state only if there exists a _________.
a) safe allocation
b) safe resource
c) safe sequence
d) all of the mentioned
124. All unsafe states are _________.
a) deadlocks
b) not deadlocks
c) fatal
d) none of the mentioned
 Operating System important questions by Infee Ma’am
125. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.
Process Maximum needs (process-wise: P0 through P2 top to bottom) Currently allocated (process-wise)

P0 P1 10 4 9 522
P2

Which of the following sequence is a safe sequence?

a) P0, P1, P2 b) P1, P2, P0
c) P2, P0, P1 d) P1, P0, P2
 Operating System important questions by Infee Ma’am
126. If no cycle exists in the resource allocation graph ________.
a) then the system will not be in a safe state
b) then the system will be in a safe state
c) all of the mentioned
d) none of the mentioned

127. The resource allocation graph is not applicable to a resource allocation system _________.
a) with multiple instances of each resource type
b) with a single instance of each resource type
c) single & multiple instances of each resource type
d) none of the mentioned

128. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.
a) less efficient
b) more efficient
c) equal
d) none of the mentioned

129. The wait-for graph is a deadlock detection algorithm that is applicable when _________.
a) all resources have a single instance
b) all resources have multiple instances
c) all resources have a single 7 multiple instances
d) all of the mentioned

130. An edge from process Pi to Pj in a wait for graph indicates that _________.
a) Pi is waiting for Pj to release a resource that Pi needs
b) Pj is waiting for Pi to release a resource that Pj needs
 Operating System important questions by Infee Ma’am
c) Pi is waiting for Pj to leave the system
d) Pj is waiting for Pi to leave the system
131. What is the disadvantage of invoking the detection algorithm for every request?
a) overhead of the detection algorithm due to consumption of memory
b) excessive time consumed in the request to be allocated memory
c) considerable overhead in computation time
d) all of the mentioned
132. A deadlock eventually cripples system throughput and will cause the CPU utilization to ______.
a) increase
b) drop
c) stay still
d) none of the mentioned
133. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify _______.
a) the set of processes that have been deadlocked
b) the set of processes in the deadlock queue
c) the specific process that caused the deadlock
d) all of the mentioned
134. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for
which the system is guaranteed to be deadlock free is?
a) 2
b) 3
c) 4
d) 1

135. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is
always less than m+n. In this setup, deadlock __________.
a) can never occur
 Operating System important questions by Infee Ma’am
b) may occur
c) has to occur
d) none of the mentioned
136. The two ways of aborting processes and eliminating deadlocks are _________.
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
d) All of the mentioned

137. The process to be aborted is chosen on the basis of the following factors?
a) priority of the process
b) process is interactive or batch
c) how long the process has computed
d) all of the mentioned

138. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be _________.
a) aborted
b) rolled back
c) terminated
d) queued

139. What is Address Binding?

a) going to an address in memory
b) locating an address with the help of another address
c) binding two addresses together to form a new address in a different memory space
d) a mapping from one address space to another
 Operating System important questions by Infee Ma’am
140. Binding of instructions and data to memory addresses can be done at __________.
a) Compile time
b) Load time
c) Execution time
d) All of the mentioned
141. What is Dynamic loading?
a) loading multiple routines dynamically
b) loading a routine only when it is called
c) loading multiple routines randomly
d) none of the mentioned
142. What is the advantage of dynamic loading?
a) A used routine is used multiple times
b) An unused routine is never loaded
c) CPU utilization increases
d) All of the mentioned
143. The address generated by the CPU is referred to as _______.
a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
144. Swapping requires a _________
a) motherboard
b) keyboard
c) monitor
d) backing store
145. CPU fetches the instruction from memory according to the value of ____________
a) program counter
 Operating System important questions by Infee Ma’am
b) status register
c) instruction register
d) program status word

146. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned

147. What is compaction?

a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation
d) a technique for overcoming fatal error

148. where does the operating system resides?

a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned

149. In contiguous memory allocation __________.

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
 Operating System important questions by Infee Ma’am
150. Transient operating system code is code that _________.
a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space