BCA502 : CORE – 19 : OPERATING SYSTEMS

MULTIPLE CHOICE QUESTIONS

1) The address of the next instruction to be executed by the current process is provided by
the
a) CPU registers
b) program counter
c) process stack
d) pipe
Answer:b
2) A Process Control Block(PCB) does not contain which of the following :
a) Process State
b) Stack
c) Heap
d) boot strap
Answer: d
3) The number of processes completed per unit time is known as __________.
a) Output
b) Throughput
c) Efficiency
d) Capacity
Answer: b
4)  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
Answer: d
5) Which of the following is not the state of a process ?
a) New
b) Old
c) Waiting
d) Running
e) Ready
Answer: b
6) The Process Control Block is :
a) Process type variable
b) Data Structure
c) a secondary storage section
d) a Block in memory
 Answer: b

7) Which of the following do not belong to queues for processes ?

a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b

8) When a process terminates : (Choose Two)

a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Answer: a and c
9) What is a long-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 these
Answer: a

10) 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
c) It selects which process to remove from memory by swapping
d) None of these
Answer: c
11) 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
Answer: b
12) 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 these
Answer: b
13) 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
Answer: c
14) A parent process calling _____ system call will be suspended until children processes
terminate.
a) wait
b) fork
c) exit
d) exec
Answer: a

15) Cascading termination refers to termination of all child processes before the parent
terminates ______.
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of these
Answer: a

16) When the process issues an I/O request :

a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue
Answer: a

17) Which of the following do not belong to queues for processes ?

a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b
18) Message passing system allows processes to :
a) communicate with one another without resorting to shared data.
b) communicate with one another by resorting to shared data.
c) share data
d) name the recipient or sender of the message
Answer: a
19) Inter process 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 without using the same
address space.
c) allows the processes to only synchronize their actions without communication.
d) None of these
a. Answer: b
20) The link between two processes P and Q to send and receive messages is called :
a) communication link
b) message-passing link
c) synchronization link
d) All of these
Answer: a
21) In indirect communication between processes P and Q :
a) there is another process R to handle and pass on the messages between P and Q
b) there is another machine between the two processes to help communication
c) there is a mailbox to help communication between P and Q
d) None of these
Answer: c
22) In the non blocking send :
a) the sending process keeps sending until the message is received
b) the sending process sends the message and resumes operation
c) the sending process keeps sending until it receives a message
d) None of these
Answer: b
23) In the Zero capacity queue : (choose two)
a) the queue has zero capacity
b) the sender blocks until the receiver receives the message
c) the sender keeps sending and the messages dont wait in the queue
d) the queue can store atleast one message
Answer: a and b
24) 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
Answer:b

25) The processes that are residing in main memory and are ready and waiting to execute are
kept on a list called
 a) job queue
b) ready queue
c) execution queue
d) process queue
Answer:b
26) Which scheduling algorithm allocates the CPU first to the process that requests the CPU
first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
Answer: a
27) In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) equal priority processes can not be scheduled
d) none of the mentioned
Answer:a
28) Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Answer:b
29) 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
d) none of the mentioned
Answer:a
30) CPU scheduling is the basis of ____________.
a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) None of these
Answer: b
31) The two steps of a process execution are : (choose two)
a) I/O Burst
b) CPU Burst
c) Memory Burst
d) OS Burst
Answer: a and b
 32) An I/O bound program will typically have :
a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts
Answer: c
33) Scheduling is done so as to :
a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
d) None of these
Answer: a
34) In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
Answer:a
35)A process can be terminated due to
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
Answer:d
36)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
Answer:b
37) Turnaround time is :
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
Answer: d
38) Waiting time is :
a) the total time in the blocked and waiting queues
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
Answer: b
 39) Response time is :
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) None of these
Answer: b
40) Round robin scheduling falls under the category of :
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these
Answer: b
41) Which process can affect of be affected by other processes executing in the system?
a) cooperating process
b) child process
c) parent process
d) init process
Answer:a
42) When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place, is called
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
Answer:b
43) If a process is executing in its critical section, then no other processes can be executing in
their critical section. This condition is called
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Answer:a
44) Which one of the following is a synchronization tool?
a) thread
b) pipe
c) semaphore
d) socket
Answer:c
45) Mutual exclusion can be provided by the
a) mutex locks
b) binary semaphores
c) both (a) and (b)
d) none of the mentioned
Answer:c
46) 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 these
Answer: a
47) Concurrent access to shared data may result in :
a) data consistency
b) data insecurity
c) data inconsistency
d) None of these
Answer: c
48) A situation where several processes access and manipulate the same data concurrently and
the outcome of the execution depends on the particular order in which access takes place is
called :
a) data consistency
b) race condition
c) aging
d) starvation
Answer: b
49) In the bakery algorithm to solve the critical section problem :
a) each process is put into a queue and picked up in an ordered manner
b) each process receives a number (may or may not be unique) and the one with the lowest
number is served next
c) each process gets a unique number and the one with the highest number is served next
d) each process gets a unique number and the one with the lowest number is served next
Answer: b
50) The TestAndSet instruction is executed :
a) after a particular process
b) periodically
c) atomically
d) None of these
Answer: c
51) The two atomic operations permissible on semaphores are : (choose two)
a) wait
b) stop
c) hold
d) signal
Answer: a and d
52) The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()
Answer: b
53) If the semaphore value is negative :
a) its magnitude is the number of processes waiting on that semaphore
b) it is invalid
c) no operation can be further performed on it until the signal operation is performed on it
d) None of these
Answer: a
54) The code that changes the value of the semaphore is :
a) remainder section code
b) non – critical section code
c) critical section code
d) None of these
Answer: c
55) In the bounded buffer problem, there are the empty and full semaphores that :
a) count the number of empty and full buffers
b) count the number of empty and full memory spaces
c) count the number of empty and full queues
d) None of these
Answer: a
56) In the bounded buffer problem :
a) there is only one buffer
b) there are n buffers ( n being greater than one but finite)
c) there are infinite buffers
d) the buffer size is bounded
Answer: b
57) To ensure difficulties do not arise in the readers – writers problem, _______ are given
exclusive access to the shared object.
a) readers
b) writers
c) None of these
Answer: b
58) The dining – philosophers problem will occur in case of :
a) 5 philosophers and 5 chopsticks
b) 4 philosophers and 5 chopsticks
c) 3 philosophers and 5 chopsticks
d) 6 philosophers and 5 chopsticks
Answer: a
59) The operations that can be invoked on a condition variable are : (choose two)
a) wait
b) hold
c) signal
d) continue
Answer: a and c
60) . To avoid deadlock
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Answer:a
61) The request and release of resources are ___________.
a) command line statements
b) interrupts
c) system calls
d) special programs
Answer: c
62) A deadlock avoidance algorithm dynamically examines the __________, to ensure that a
circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources
Answer: a
63) . A memory buffer used to accommodate a speed differential is called
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Answer:b
64) . Which one of the following is the address generated by CPU?
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
Answer:c
65) Run time mapping from virtual to physical address is done by
a) memory management unit
b) CPU
c) PCI
d) none of the mentioned
Answer:a
66) 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
Answer:b
67) For a deadlock to arise, which of the following conditions must hold simultaneously ? (
choose all that apply )
a) Mutual exclusion
b) Starvation
c) Hold and wait
d) No preemption
e) Circular wait
Answer: a, c, d and e
68) Which of the following condition is required for deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
Answer:d

69) Which one of the following is the deadlock avoidance algorithm?

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
Answer:a
70) Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
Answer:a
71) 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 these
Answer: b
72)  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) either a or b
d) None of these
Answer: b
73) A FIFO replacement algorithm associates with each page the _______
a) time it was brought into memory
b) size of the page in memory
c) page after and before it
d) All of these
Answer: a
74) Which of the following page replacement algorithms suffers from Belady’s Anomaly ?
a) Optimal replacement
b) LRU
c) FIFO
d) Both optimal replacement and FIFO
Answer: c
75) A memory page containing a heavily used variable that was initialized very early and is in
constant use is removed, then the page replacement algorithm used is :
a) LRU
b) LFU
c) FIFO
d) None of these
Answer: c
Explanation: None.
76) he aim of creating page replacement algorithms is to :
a) replace pages faster
b) increase the page fault rate
c) decrease the page fault rate
d) to allocate multiple pages to processes
Answer: c
77) Optimal page – replacement algorithm is :
a) Replace the page that has not been used for a long time
b) Replace the page that has been used for a long time
c) Replace the page that will not be used for a long time
d) None of these
Answer: c
78) Optimal page – replacement algorithm is difficult to implement, because :
a) it requires a lot of information
b) it requires future knowledge of the reference string
c) it is too complex
d) it is extremely expensive
Answer: b
79) two methods how LRU page replacement policy can be implemented in hardware are :
(choose two)
a) Counters
b) RAM
c) Stack
d) Registers
Answer: a and c
80) here is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called
:
a) queue algorithms
b) stack algorithms
c) string algorithms
d) None of the mentioned
Answer: b
81) The essential content(s) in each entry of a page table is / are :
a) Virtual page number
b) Page frame number
c) Both virtual page number and page frame number
d) Access right information
Answer: b
82) Because of virtual memory, the memory can be shared among
a) processes
b) threads
c) instructions
d) none of the mentioned
Answer:a
83) _____ is the concept in which a process is copied into main memory from the secondary
memory according to the requirement.
a) Paging
b) Demand paging
c) Segmentation
d) Swapping
Answer:b
84) Swap space exists in
a) primary memory
b) secondary memory
c) CPU
d) none of the mentioned
Answer:b
85) When a program tries to access a page that is mapped in address space but not loaded in
physical memory, then
a) segmentation fault occurs
b) fatal error occurs
c) page fault occurs
d) no error occurs
Answer:c
86) In FIFO page replacement algorithm, when a page must be replaced
a) oldest page is chosen
b) newest page is chosen
c) random page is chosen
d) none of the mentioned
Answer:a
87) Which algorithm chooses the page that has not been used for the longest period of time
whenever the page required to be replaced?
a) first in first out algorithm
b) additional reference bit algorithm
c) least recently used algorithm
d) counting based page replacement algorithm
Answer:c
88) Virtual memory allows :
a) execution of a process that may not be completely in memory
b) a program to be larger than the physical memory
c) a program to be larger than the secondary storage
d) execution of a process without being in physical memory
Answer: a and b
89) The instruction being executed, must be in :
a) physical memory
b) logical memory
c) None of these
Answer: a
90) In virtual memory. the programmer __________ of overlays.
a) has to take care
b) does not have to take care
c) None of these
Answer: b
91) Virtual memory is normally implemented by ________.
a) demand paging
b) buses
c) virtualization
d) All of these
Answer: a
92) A page fault occurs when :
a) a page gives inconsistent data
b) a page cannot be accesses due to its absence from memory
c) a page is invisible
d) All of these
Answer: b
93) When a page fault occurs, the state of the interrupted process is :
a) disrupted
b) invalid
c) saved
d) None of these
Answer: c
94) When a process begins execution with no pages in memory :
a) process execution becomes impossible
b) a page fault occurs for every page brought into memory
c) process causes system crash
d) None of these
Answer: b
95) Program always deals with
a) logical address
b) absolute address
c) physical address
d) relative address
Answer:a
96) The page table contains
a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned
Answer:a
97) Operating System maintains the page table for
a) each process
b) each thread
c) each instruction
d) each address
Answer:a
98) 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
Answer:c
99) In segmentation, each address is specified by :
a) a segment number
b) an offset
c) a value
d) a key
Answer: a and b
100) Each entry in a segment table has a :
a) segment base
b) segment peak
c) segment limit
d) segment value
Answer: a and c
101) The segment base contains the :
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) None of these
Answer: b
102) The segment limit contains the :
a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) None of these
View Answer
Answer: c
103) External fragmentation exists when :
a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) None of these
Answer: a
104) When the memory allocated to a process is slightly larger than the process, then :
a) internal fragmentation occurs
b) external fragmentation occurs
c) both a and b
d) neither a nor b
Answer: a
105) A solution to the problem of external fragmentation is :
a) compaction
b) larger memory space
c) smaller memory space
d) None of these
Answer: a
106) 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 these
Answer: a
107) The relocation register helps in :
a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) None of these
Answer: c
108) With relocation and limit registers, each logical address must be _______ the limit register.
a) less than
b) equal to
c) greater than
d) None of these
Answer: a
109) A monitor is a type of :
a) semaphore
b) low level synchronization construct
c) high level synchronization construct
d) None of these
Answer: c
110) The operations that can be invoked on a condition variable are : (choose two)
a) wait
b) hold
c) signal
d) continue
Answer: a and c
111). ______ is a unique tag, usually a number, identifies the file within the file system.
a) File identifier
b) File name
c) File type
d) none of the mentioned
Answer:a
112) To create a file
a) allocate the space in file system
b) make an entry for new file in directory
c) both (a) and (b)
d) none of the mentioned
Answer:c
113) By using the specific system call, we can
a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Answer:d
114) File type can be represented by
a) file name
b) file extension
c) file identifier
d) none of the mentioned
Answer:b
115) Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
Answer:b
116) In which type of allocation method each file occupy a set of contiguous block on the disk?
a) contiguous allocation
b) dynamic-storage allocation
c) linked allocation
d) indexed allocation
Answer:a
117) The information about all files is kept in :
a) swap space
b) operating system
c) seperate directory structure
d) None of these
Answer: c
118) The file name is generally split into two parts :
a) name
b) identifier
c) extension
d) type
Answer: a and c
119) Sequential access method ______ , on random access devices.
a) works well
b) doesnt work well
c) Both a and b
d) None of these
Answer: a
120) For a direct access file :
a) there are restrictions on the order of reading and writing
b) there are no restrictions on the order of reading and writing
c) access is restricted permission wise
d) access is not restricted permission wise
Answer: b
123) The file system “NTFS” stands for
a)  New Type File System
b)  Never Terminated File System
c)  New Technology File System
d)  Non Terminated File System
 Answer: c
124) The PCB contains information that makes the process ………….. entity
a)dynamic
b)passive
c)an active
d)static
Answer: c
125) The ready queue is nothing but a list of ……….. implemented as a linked list
a) Process
b)both a and b
c)PCB’s
d)processor
Answer: c
126) The operating system scheduler schedules processes from the ………. for execution by the
CPU
a) ready queue
b)waiting queue
c)running queue
d)Both a and b
Answer:a
127) The short-term scheduler (or CPU scheduler) carries out the -----------
a) selection process
b)execution process
c)starter process
d)termination process
Answer:a
128) CPU switching from one process to another requires saving the state of the current process
and loading the latest state of the next process, is known as……….
a) context switch
b)packet switch
c)process switch
d)processor switch
Answer:a
129) Module that gives control of the CPU to the process selected by the short-term scheduler is
known as --------
a) dispatcher
b)sheduler
c)manager
d)connector
Answer:a
130) Number of processes completed per time unit is called----------
a) throughput.
b) CPU utilization
c) Turnaround time
d) Response time
Answer:a
131)If process pi is executing in its critical-section, then no other processes can be executing in
their critical-sections. technique is called……….
a) Mutual Exclusion
b) Bounded Waiting
c) Progress
d) both a and b
Answer:a
138)An algorithm developed for solving the critical-section problem for n processes is also
called ………..
a) Scheduling algorithm
b Bakery algorithm,
c) queuing algorithm
d) Both a and b
Answer:b
139) A -------------- is a collection of procedures, variables and data structures grouped together
a) monitor
b Semaphores
c) detector
d) Both a and b
Answer:a
140)The situation where we have a set of processes each holding some resources, each
requesting some resources, and none of them is able to obtain what it needs. Such situation is
called------------
a) Deadlock
b) reusable
c) Mutual exclusion
d) Both a and b
Answer:a
141) A situation where the total size of hole is divided into a set of smaller holes is large enough
to hold another process for execution but the process cannot be loaded, as the hole is not
contiguous. This is known as -------------.
a) external fragmentation
b) Internal fragmentation
c) both a and b
d) reallocation
Answer:a
142) In first-in-first-out page replacement algorithm when a page replacement is required the
------------ in memory is the victim.
a) dead page
b) Recent page
c) oldest page
d) Both a and b
Answer:c
143)An optimal page replacement algorithm produces the -------------rate of all algorithms
a) lowest page fault
b) Highest page fault
c) both a and b
d) fragmentation
Answer:a
144) IPC stands for-------------
a) intellectual process community
b) Inter-personal communication
c) Inter-processor communication
d) Inter-personal community
Answer:c
145) The round-robin CPU scheduling algorithm is basically a ----------scheduling algorithm
designed for --------------- systems
a) non-preemptive, time-sharing
b) non-preemptive, multi- processor
c) preemptive, resource-sharing
d) preemptive , time-sharing
Answer:d
146) Which of the following is not the approach to dealing with deadlock?
a) Prevention
b) Avoidance
c) Detection
d) Deletion
Answer:d
147) .............. refers to a situation in which a process is ready to execute but is continuously
denied access to a processor in deference to other processes.
a) Synchronization
b) Mutual Exclusion
c) Dead lock
d) Starvation
Answer:d
147) With ................ a page is brought into main memory only when the reference is made to a
location on that page.
a) demand paging
b) main paging
c) prepaging
d) postpaging
Answer:a
148) Process is ........................
a) a program in execution
b) an instance of a program running on a computer.
c) the entity that can be assigned to and executed
d) all of the above.
Answer:d
149) ............... refers to the ability of multiple process (or threads) to share code, resources or
data in such a way that only one process has access to shared object at a time.
a) synchronization
b) mutual exclusion
c) dead lock
d) starvation
Answer:b
150) ................... is a facility that allows programmers to address memory from a logical point of
view, without regard to the main memory, physically available.
a) visual memory
b) real memory
c) virtual memory
d) secondary memory
Answer:c
151)  A direct method of deadlock prevention is to prevent the occurrences of ...................
a) mutual exclusion
b) hold and wait
c) circular waits
d) no preemption
Answer:c
152) Main function of shared memory is:
a)to use primary memory efficently
b)to do intra process communication
c)to do inter process communication
d)none of above
Answer:c
153)  Belady anamoly occurs in
a) Optimal replacement
b) FIFO
c) LRU
d)both in FIFO and LRU
Answer:b
154) Which scheduling policy is best suited for time-sharing operating systems
a)Shortest job first
b)Round robin
c)First come first serve
d)Elevator
Answer:b
155)  Which is non pre-emptive
a)Round robin
b)FIFO
c)MQS
d)MQSF
Answer:b
156)A page fault occurs
a)when a page is not in memory
b) when a page is in memory
c)when a process in the ready state
d) when a process in the ready state
Answer:a
157)What is a shell?
a)it is a hardware component
b) it is a software component
c)it is a command interpreter
d) it is a tool in cpu scheduling
Answer:c
158) Interval between the time of submission and completion of the job is
called
(a) Waiting time
(b) Turnaround time
(c) Throughput
(d) Response time
Answer:b
159) A scheduler which selects processes from secondary storage device is
called
(a) Short term scheduler.
 (b) Long term scheduler.
(c) Medium term scheduler.
(d) Process scheduler
Answer:c
160) The scheduling in which CPU is allocated to the process with least CPU-burst time
is called
(a) Priority Scheduling
(b) Shortest job first Scheduling
(c) Round Robin Scheduling
(d) Multilevel Queue Scheduling
Answer:b
161) The “turn-around” time of a user job is the
(a) time since its submission to the time its results become available.
(b) time duration for which the CPU is allotted to the job.
(c) total time taken to execute the job.
(d) time taken for the job to move from assembly phase to completion phase.
Answer:c
162)Which of the following is not a fundamental process state
(a) ready
(b) terminated
(c) executing
(d) blocked
Answer:d
163) ‘LRU’ page replacement policy is
a) Last Replaced Unit.
b) Last Restored Unit.
c) Least Recently Used.
d) Least Required Unit.
Answer:c
164) A critical section is a program segment
(a) which should run in a certain specified amount of time.
(b) which avoids deadlocks.
(c) where shared resources are accessed.
(d) which must be enclosed by a pair of semaphore operations, P and V.
Answer:c
165) Jobs which are admitted to the system for processing is called
(a) long-term scheduling
(b) short-term scheduling
(c) medium-term scheduling
(d) queuing
Answer:a
166) The memory allocation scheme subject to “external” fragmentation is
(a) segmentation
(b) swapping
(c) pure demand paging
(d) multiple fixed contiguous partitions
Answer:a
167) ___________ is a technique of improving the priority of process waiting in Queue
for CPU allocation
(a) Starvation
(b) Ageing
(c) Revocation
(d) Relocation
Answer:b
168) Memory management is 
a) not used in modern operating system 
b)replaced with virtual memory on current system 
c) not used on multiprogramming systems 
d) critical for even the simplest operating system
Answer:b
169) The operating system of a computer serves as a software interface between the user and 
a) hardware
 b) peripheral
c) memory  
d) screen 
Answer:a
170)  Moving Process from main memory to disk is called 
a) scheduling
b)caching
c) swapping
d) spooling 
Answer:c
171) What are the two types of Semaphore?

a) . Digital Semaphores and Binary Semaphores

b) Analog Semaphores and Octal Semaphores         
c) Counting Semaphores and Binary Semaphores
d) Critical Semaphores and System Semaphores
Answer:c
172) Which of the following is not process states?
a) New
b) Running
c) Ready
d) Finished
Answer:d
173) Which of the following is the allocation method of a disk space?
a)Contiguous allocation
b). Linked allocation
c). Indexed allocation
d) All of the Above
Answer:d
174) What do you mean by Memory Compaction?
a)Combine multiple equal memory holes into one big hole
b) Combine multiple small memory holes into one big hole
c) Divide big memory hole into small holes
d). Divide memory hole by 2
Answer:b
175) Which one of the following is not the function of Operating System?
a)  Resource Management
b)  File Management
c)  Networking
d)  Processor Management
Answer:c
176) The Banker’s algorithm is used
a).  to rectify deadlock
b)  to detect deadlock        
c)  to prevent deadlock
d)  to slove deadlock
Answer:c
177) The necessary conditions needed before deadlock can occur?
a).  No Mutual Exclusion, Hold and wait, Preemption, Circular Wait
b)  Mutual Exclusion, No Hold and wait, Preemption, Circular Wait
c)  Mutual Exclusion, Hold and wait, No Preemption, Circular Wait
d)  Mutual Exclusion, Hold and wait, Preemption, No Circular Wait
Answer:c
178) Copying a process from memory to disk to allow space for other processes is Called
a).  Swapping
b)  Deadlock
c)  Demand Paging
d)  Page Fault
Answer:a
179) First-in-First-Out (FIFO) scheduling is
a).  Non Preemptive Scheduling
b)  Preemptive Scheduling
c).  Fair Share Scheduling
d)  Deadline Scheduling
Answer:a
180) Virtual Memory is
a)  Extremely Large Main memory
b)  Extremely Large Secondary memory
c)  An illusion of extremely large main memory
d)  An illusion of extremely large secondary memory
Answer:c
181) . ______ shares characteristics with both hardware and software
a) Operating system
b) Software
c). Data
d) None
Answer:a
182) The primary purpose of an operating system is:
a) To make the most efficient use of the computer hardware
b) To allow people to use the computer,
c). To keep systems programmers employed
d) To make computers easier to use
Answer:a
183) In the blocked state
a) the processes waiting for I/O are found
b)the process which is running is found
c) the processes waiting for the processor are found
d) none of the above
Answer:a
184) The process related to process control, file management, device management, information
about system and communication that is requested by any higher level language can be
performed by __________.
a)Editors
b) Compilers
c) System Call
d)Caching
Answer:c
185) The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded
Waiting.
a) The statement is false
b) The statement is true.
c) The statement is contradictory.
d)None of the above
Answer:b
186) The number of processes completed per unit time is known as __________.
a) Output
b) Throughput
c) Efficiency
d) Capacity
Answer:b
187) _________ is the situation in which a process is waiting on another process,which is also
waiting on another process ... which is waiting on the first process. None of the processes
involved in this circular wait are making progress.
a) Deadlock
b)Starvation
c)Dormant
d)None of the above
Answer:a
188) ) A critical region
a)is a piece of code which only one process executes at a time
b)is a region prone to deadlock
c)is a piece of code which only a finite number of processes execute
d) is found only in Windows NT operation system
Answer:a
189) Which directory implementation is used in most Operating System?
a) Single level directory structure
b) Two level directory structure
c)Tree directory structure
d)Acyclic directory structure
Answer:c
190) ______ is a high level abstraction over Semaphore.
a) Shared memory
b) Message passing
c)Monitor
d) Mutual exclusion
Answer:c
191) A tree sturctured file directory system
a) allows easy storage and retrieval of file names
b)is a much debated unecessary feature
c)is not essential when we have millions of files
d) none of the above
Answer:a
192) Which technique was introduced because a single job could not keep both the CPU and the
I/O devices busy?
a) Time-sharing
b)SPOOLing
c)Preemptive scheduling
d) Multiprogramming
Answer:d
193) A page fault occurs
a)when the page is not in the memory
b) when the page is in the memory
c) when the process enters the blocked state
d) when the process is in the ready state
Answer:a
194) What does Belady’s Anomaly related to?
a). Page Replacement Algorithm
b). Memory Management Algorithm
c) Deadlock Prevention Algorithm
d). Disk Scheduling Algorithm
Answer:a
195) .............. refers to a situation in which a process is ready to execute but is continuously
denied access to a processor in deference to other processes.
a) Synchronization
b) Mutual Exclusion
c) Dead lock
d) Starvation
Answer:d
196) The Primary job of the operating system is
a)  Manage Commands
b)  Manage Users        
c)  Manage Programs
d)  Manage Resources
Answer:d
197) Who is called a supervisor of computer activity?
a)  Memory
b)  Operating System
c)  I/O Devices
d)  Control Unit
Answer:b
198) Which is the first program run on a computer when the computer boots up?
a). System software
b). Operating system
c) System operations
d) None
Answer:b
199) Which is built directly on the hardware?
a) Computer Environment
b) Application Software
c) Operating System
d) Database System
Answer:c
200) Process Management function of an operating system kernel includes.
a) Process creation and termination.
b) Process scheduling and dispatching
c) Process switching
d) All of the above
Answer:d