The interrupt vector contains

the memory addresses of specialized interrupt handlers

What is a short-term scheduler?

it selects which process to remove from memory by swapping

it selects which process has to be brought into the ready queue

it selects which process has to be executed next and allocates cpu

it selects which process to remove from memory by swapping

Which is the most optimal scheduling algorithm?

fcfs – first come first served

Cancellation point is the point where

the whole process can be cancelled safely

the thread can be cancelled – safely or otherwise doesn’t matter

the thread can be cancelled safely

the whole process can be cancelled safely

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

the system can allocate resources to each process in some order and still avoid a deadlock

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

process is interactive or batch

how long the process has computed

The first fit, best fit and worst fit are strategies to select a

process from a queue to put in memory

processor to run the next process

free hole from a set of available holes

there are two copies of the file

the changes made by one person are not reflected to the

the changes made by one person are reflected to the other

holds the only copy of the data

In the Many to One model, if a thread makes a blocking system call

a part of the process will stay blocked, with the rest running

the entire process will be blocked

a part of the process will stay blocked, with the rest running

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

overhead of the detection algorithm due to consumption of memory

excessive time consumed in the request to be allocated memory

considerable overhead in computation time

The child process can

never be a duplicate of the parent process

be a duplicate of the parent process

never be a duplicate of the parent process

cannot have another program loaded into it

never have another program loaded into it

Each connection arriving at multi threaded servers via network is generally

is kept in a normal queue and then sent to the blocking queue from where it is dequeued

is directly put into the blocking queue

is wrapped as a task and passed on to a thread pool

is kept in a normal queue and then sent to the blocking queue from where it is dequeued

A block device transfers

with unpredictable response times

What is the disk bandwidth?

the total number of bytes transferred

total time between the first request for service and the completion on the last transfer

the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer

If no process is suspended, the signal operation

puts the system into a deadlock state

suspends some default process execution

In a multiprogramming environment

a single user can execute many programs at the same time

the processor executes more than one process at a time

the programs are developed by more than one person

more than one process resides in the memory

a single user can execute many programs at the same time

If the semaphore value is negative

its magnitude is the number of processes waiting on that semaphore

no operation can be further performed on it until the signal operation is performed on it

servicing multiple requests using one thread

servicing a single request using multiple threads from the pool

faster servicing of requests with an existing thread rather than waiting to create a new thread

When a web page is loading, and the user presses a button on the browser to stop loading the page?

the thread loading the page continues with the loading

the thread loading the page does not stop but continues with another task

the thread loading the page is paused

the thread loading the page is cancelled

What is the operating system?

either low or high memory (depending on the location of interrupt vector)

In the Many to Many model true concurrency cannot be gained because

other threads only from other processes are allowed to run

other threads are strictly prohibited from running

other threads are allowed to run

other threads only from other processes are allowed to run

What is the Optimal page – replacement algorithm?

replace the page that has not been used for a long time

replace the page that has been used for a long time

replace the page that will not be used for a long time

1690 + Mcqs in Operating System in Technical Programming Page 4 McqOptions

151.	When device A has a cable that plugs into device B, and device B has a cable that plugs into device C and device C plugs into a port on the computer, this arrangement is called a
A.	port
B.	daisy chain
C.	bus
D.	cable
Answer» C. bus

Discussion

152.	The consists of all processes whose memory images are in the backing store or in memory and are ready to run.
A.	wait queue
B.	ready queue
C.	cpu
D.	secondary storage
Answer» C. cpu

Discussion

153.	The interrupt vector contains
A.	the interrupts
B.	the memory addresses of specialized interrupt handlers
C.	the identifiers of interrupts
D.	the device addresses
Answer» C. the identifiers of interrupts

Discussion

154.	If M denotes the number of memory locations and N denotes the word size, then an expression that denotes the storage capacity is
A.	m*n
B.	m+n
C.	2m+n
D.	2m-n
Answer» B. m+n

Discussion

155.	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
Answer» C. it selects which process to remove from memory by swapping

Discussion

156.	If relocation is static and is done at assembly or load time, compaction
A.	cannot be done
B.	must be done
C.	must not be done
D.	can be done
Answer» B. must be done

Discussion

157.	The size of a process is limited to the size of
A.	physical memory
B.	external storage
C.	secondary storage
D.	none of the mentioned
Answer» B. external storage

Discussion

158.	Which is the most optimal scheduling algorithm?
A.	fcfs – first come first served
B.	sjf – shortest job first
C.	rr – round robin
D.	none of the mentioned
Answer» C. rr – round robin

Discussion

159.	If the resources are always preempted from the same process can occur.
A.	deadlock
B.	system crash
C.	aging
D.	starvation
Answer» E.

Discussion

160.	Cancellation point is the point where
A.	the thread can be cancelled – safely or otherwise doesn’t matter
B.	the thread can be cancelled safely
C.	the whole process can be cancelled safely
D.	none of the mentioned
Answer» C. the whole process can be cancelled safely

Discussion

161.	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
Answer» E.

Discussion

162.	In the algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
A.	look
B.	scan
C.	c-scan
D.	c-look
Answer» D. c-look

Discussion

163.	If no frames are free, page transfer(s) is/are required.
A.	one
B.	two
C.	three
D.	four
Answer» C. three

Discussion

164.	Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
A.	the system can allocate resources to each process in some order and still avoid a deadlock
B.	there exist a safe sequence
C.	all of the mentioned
D.	none of the mentioned
Answer» B. there exist a safe sequence

Discussion

165.	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
Answer» E.

Discussion

166.	The first fit, best fit and worst fit are strategies to select a
A.	process from a queue to put in memory
B.	processor to run the next process
C.	free hole from a set of available holes
D.	all of the mentioned
Answer» D. all of the mentioned

Discussion

167.	With a shared file
A.	actual file exists
B.	there are two copies of the file
C.	the changes made by one person are not reflected to the
D.	the changes made by one person are reflected to the other
Answer» E.

Discussion

168.	Spooling
A.	holds a copy of the data
B.	is fast memory
C.	holds the only copy of the data
D.	holds output for a device
Answer» D. holds output for a device

Discussion

169.	Which of the following scheduling algorithms gives minimum average waiting time?
A.	fcfs
B.	sjf
C.	round – robin
D.	priority
Answer» C. round – robin

Discussion

170.	In the Many to One model, if a thread makes a blocking system call
A.	the entire process will be blocked
B.	a part of the process will stay blocked, with the rest running
C.	the entire process will run
D.	none of the mentioned
Answer» B. a part of the process will stay blocked, with the rest running

Discussion

171.	In Operating Systems, which of the following is/are CPU scheduling algorithms?
A.	round robin
B.	shortest job first
C.	priority
D.	all of the mentioned
Answer» E.

Discussion

172.	If execution time binding is being used, then a process be swapped to a different memory space.
A.	has to be
B.	can never
C.	must
D.	may
Answer» E.

Discussion

173.	What is the disadvantage of invoking the detection algorithm for every request?
A.	overhead of the detection algorithm due to consumption of memory
B.	excessive time consumed in the request to be allocated memory
C.	considerable overhead in computation time
D.	all of the mentioned
Answer» D. all of the mentioned

Discussion

174.	The register is read by the host to get input.
A.	flow in
B.	flow out
C.	data in
D.	data out
Answer» D. data out

Discussion

175.	The child process can
A.	be a duplicate of the parent process
B.	never be a duplicate of the parent process
C.	cannot have another program loaded into it
D.	never have another program loaded into it
Answer» B. never be a duplicate of the parent process

Discussion

176.	SSTF algorithm, like SJF of some requests.
A.	may cause starvation
B.	will cause starvation
C.	does not cause starvation
D.	causes aging
Answer» B. will cause starvation

Discussion

177.	For large data transfers, is used.
A.	dma
B.	programmed i/o
C.	controller register
D.	none of the mentioned
Answer» B. programmed i/o

Discussion

178.	Each connection arriving at multi threaded servers via network is generally
A.	is directly put into the blocking queue
B.	is wrapped as a task and passed on to a thread pool
C.	is kept in a normal queue and then sent to the blocking queue from where it is dequeued
D.	none of the mentioned
Answer» C. is kept in a normal queue and then sent to the blocking queue from where it is dequeued

Discussion

179.	A block device transfers
A.	bytes one by one
B.	block of bytes as a unit
C.	with unpredictable response times
D.	none of the mentioned
Answer» C. with unpredictable response times

Discussion

180.	For every process there is a
A.	page table
B.	copy of page table
C.	pointer to page table
D.	all of the mentioned
Answer» B. copy of page table

Discussion

181.	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
Answer» C. terminated

Discussion

182.	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
Answer» C. stay still

Discussion

183.	What is the disk bandwidth?
A.	the total number of bytes transferred
B.	total time between the first request for service and the completion on the last transfer
C.	the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

184.	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
Answer» D. the output is unpredictable

Discussion

185.	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
Answer» D. a single user can execute many programs at the same time

Discussion

186.	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 the mentioned
Answer» B. it is invalid

Discussion

187.	Thread pools help in
A.	servicing multiple requests using one thread
B.	servicing a single request using multiple threads from the pool
C.	faster servicing of requests with an existing thread rather than waiting to create a new thread
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

188.	When a web page is loading, and the user presses a button on the browser to stop loading the page?
A.	the thread loading the page continues with the loading
B.	the thread loading the page does not stop but continues with another task
C.	the thread loading the page is paused
D.	the thread loading the page is cancelled
Answer» E.

Discussion

189.	The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is
A.	the cost incurred
B.	the memory used
C.	the cpu used
D.	all of the mentioned
Answer» B. the memory used

Discussion

190.	If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order bits of a logical address designate the page number, and the low order bits designate the page offset.
A.	m, n
B.	n, m
C.	m – n, m
D.	m – n, n
Answer» E.

Discussion

191.	What is the operating system?
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
Answer» D. none of the mentioned

Discussion

192.	What does MBR stand for?
A.	main buffer register
B.	memory buffer routine
C.	main buffer routine
D.	memory buffer register
Answer» E.

Discussion

193.	In the Many to Many model true concurrency cannot be gained because
A.	other threads are strictly prohibited from running
B.	other threads are allowed to run
C.	other threads only from other processes are allowed to run
D.	none of the mentioned
Answer» C. other threads only from other processes are allowed to run

Discussion

194.	Word length of a personal computer
A.	64bits
B.	16 bits
C.	8 bits
D.	32 bits
Answer» D. 32 bits

Discussion

195.	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» B. critical exclusion

Discussion

196.	What is the Optimal page – replacement algorithm?
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 the mentioned
Answer» D. none of the mentioned

Discussion

197.	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 the mentioned
Answer» D. none of the mentioned

Discussion

198.	With multiprogramming is used productively.
A.	time
B.	space
C.	money
D.	all of the mentioned
Answer» B. space

Discussion

199.	In UNIX, the set of masked signals can be set or cleared using the function.
A.	sigmask
B.	sigmaskproc
C.	sigprocmask
D.	sigproc
Answer» D. sigproc

Discussion

200.	If multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be
A.	continued
B.	cancelled
C.	protected
D.	none of the mentioned
Answer» C. protected

Discussion

Explore topic-wise MCQs in Technical Programming.

When device A has a cable that plugs into device B, and device B has a cable that plugs into device C and device C plugs into a port on the computer, this arrangement is called a

The consists of all processes whose memory images are in the backing store or in memory and are ready to run.

The interrupt vector contains

If M denotes the number of memory locations and N denotes the word size, then an expression that denotes the storage capacity is

What is a short-term scheduler?

If relocation is static and is done at assembly or load time, compaction

The size of a process is limited to the size of

Which is the most optimal scheduling algorithm?

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

Cancellation point is the point where

The context of a process in the PCB of a process does not contain

In the algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

If no frames are free, page transfer(s) is/are required.

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

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

The first fit, best fit and worst fit are strategies to select a

With a shared file

Spooling

Which of the following scheduling algorithms gives minimum average waiting time?

In the Many to One model, if a thread makes a blocking system call

In Operating Systems, which of the following is/are CPU scheduling algorithms?

If execution time binding is being used, then a process be swapped to a different memory space.

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

The register is read by the host to get input.

The child process can

SSTF algorithm, like SJF of some requests.

For large data transfers, is used.

Each connection arriving at multi threaded servers via network is generally

A block device transfers

For every process there is a

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

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

What is the disk bandwidth?

If no process is suspended, the signal operation

In a multiprogramming environment

If the semaphore value is negative

Thread pools help in

When a web page is loading, and the user presses a button on the browser to stop loading the page?

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is

If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order bits of a logical address designate the page number, and the low order bits designate the page offset.

What is the operating system?

What does MBR stand for?

In the Many to Many model true concurrency cannot be gained because

Word length of a personal computer

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called?

What is the Optimal page – replacement algorithm?

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

With multiprogramming is used productively.

In UNIX, the set of masked signals can be set or cleared using the function.

If multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be