Multithreading on a multi – CPU machine

can have multiple or a single thread for execution

has multiple threads of execution

has a single thread of execution

can have multiple or a single thread for execution

An edge from process Pi to Pj in a wait for graph indicates that

pj is waiting for pi to release a resource that pj needs

pi is waiting for pj to release a resource that pi needs

pj is waiting for pi to release a resource that pj needs

pi is waiting for pj to leave the system

pj is waiting for pi to leave the system

What is Response time?

the total time taken from submission time till the response is output

the total time taken from the submission time till the completion time

the total time taken from the submission time till the first response is produced

the total time taken from submission time till the response is output

LRU page – replacement algorithm associates with each page the

time it was brought into memory

the time of that page’s last use

Mutual exclusion implies that

if a process is executing in its critical section, then other processes must be executing in their critical sections

if a process is executing in its critical section, then no other process must be executing in their critical sections

if a process is executing in its critical section, then other processes must be executing in their critical sections

if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

What does RAID stand for?

redundant array of inexpensive disks

redundant array of independent disks

redundant array of inexpensive disks

redundant array of intermediate disks

redundant array of improper disks

The offset ‘d’ of the logical address must be

between 0 and the segment number

greater than the segment number

Cancelling a thread asynchronously

frees all the resources properly

What is a dedicated device?

can be used concurrently by several processes

In contiguous memory allocation

all processes are contained in a single contiguous section of memory

each process is contained in a single contiguous section of memory

all processes are contained in a single contiguous section of memory

Memory protection in a paged environment is accomplished by

protection algorithm with each page

restricted access rights to users

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.

processes that have previously been in the system

resources currently allocated to each process

future requests and releases of each process

When is the Many to One model at an advantage?

when the program has to be multi- threaded

when the program does not need multithreading

when the program has to be multi- threaded

when there is a single processor

What is a long-term scheduler?

it selects processes which have to be executed next and allocates cpu

it selects processes which have to be brought into the ready queue

it selects processes which have to be executed next and allocates cpu

it selects processes which heave to remove from memory by swapping

must be accessed from only one process

can be accessed from multiple processes

The dining – philosophers problem will occur in case of

4 philosophers and 5 chopsticks

5 philosophers and 5 chopsticks

4 philosophers and 5 chopsticks

3 philosophers and 5 chopsticks

6 philosophers and 5 chopsticks

A character stream device transfers

with unpredictable response times

What is the main function of the command interpreter?

to provide the interface between the api and application program

to get and execute the next user-specified command

to provide the interface between the api and application program

to handle the files in operating system

What is the reason for using the LFU page replacement algorithm?

a less used page has more chances to be used again

an actively used page should have a large reference count

a less used page has more chances to be used again

it is extremely efficient and optimal

A process having multiple threads of control implies

it can do only one task at a time, but much faster

it can do more than one task at a time

it can do only one task at a time, but much faster

it has to use only one thread per process

The header and trailer of a sector contain information used by the disk controller such as and

error correcting codes (ecc) & sector number

disk identifier & sector number

What is a reusable resource?

that can be used by more than one process at a time

that can be used by one process at a time and is not depleted by that use

that can be used by more than one process at a time

that can be shared between various threads

Write ahead logging is a way

that records data on stable storage

The ability to execute a program that is only partially in memory has benefits like

the amount of physical memory cannot put a constraint on the program

programs for an extremely large virtual space can be created

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

251.	Multithreading on a multi – CPU machine
A.	has multiple threads of execution
B.	has a single thread of execution
C.	can have multiple or a single thread for execution
D.	none of the mentioned
Answer» C. can have multiple or a single thread for execution

Discussion

252.	In question 2, if the number of page frames is increased to 4, then the number of page transfers
A.	decreases
B.	increases
C.	remains the same
D.	none of the mentioned
Answer» C. remains the same

Discussion

253.	Winchester disks are a type of
A.	optical disks
B.	magnetic disks
C.	compact disks
D.	magnetic drives
Answer» C. compact disks

Discussion

254.	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
C.	pi is waiting for pj to leave the system
D.	pj is waiting for pi to leave the system
Answer» B. pj is waiting for pi to release a resource that pj needs

Discussion

255.	Memory management technique in which system stores and retrieves data from secondary storage for use in main
A.	fragmentation
B.	paging
C.	mapping
D.	None of the mentioned
Answer» C. mapping

Discussion

256.	storage is a system where a robotic arm will connect or disconnect off- line mass storage media according to the computer operating system demands.
A.	secondary
B.	virtual
C.	tertiary
D.	magnetic
Answer» D. magnetic

Discussion

257.	Brain of computer is
A.	control unit
B.	arithmetic and logic unit
C.	central processing unit
D.	memory
Answer» D. memory

Discussion

258.	What is Response time?
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 the mentioned
Answer» C. the total time taken from submission time till the response is output

Discussion

259.	LRU page – replacement algorithm associates with each page the
A.	time it was brought into memory
B.	the time of that page’s last use
C.	page after and before it
D.	all of the mentioned
Answer» C. page after and before it

Discussion

260.	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
Answer» B. if a process is executing in its critical section, then other processes must be executing in their critical sections

Discussion

261.	There 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» C. string algorithms

Discussion

262.	What does RAID stand for?
A.	redundant array of independent disks
B.	redundant array of inexpensive disks
C.	redundant array of intermediate disks
D.	redundant array of improper disks
Answer» B. redundant array of inexpensive disks

Discussion

263.	controller sends the command placed into it, via messages to the controller.
A.	host, host
B.	disk, disk
C.	host, disk
D.	disk, host
Answer» D. disk, host

Discussion

264.	Magnetic tape drives can write data at a speed disk drives.
A.	much lesser than
B.	comparable to
C.	much faster than
D.	none of the mentioned
Answer» C. much faster than

Discussion

265.	The offset ‘d’ of the logical address must be
A.	greater than segment limit
B.	between 0 and segment limit
C.	between 0 and the segment number
D.	greater than the segment number
Answer» C. between 0 and the segment number

Discussion

266.	Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?
A.	2048
B.	256
C.	64
D.	8
Answer» D. 8

Discussion

267.	Cancelling a thread asynchronously
A.	frees all the resources properly
B.	may not free each resource
C.	spoils the process execution
D.	none of the mentioned
Answer» C. spoils the process execution

Discussion

268.	TestAndSet instruction is executed
A.	after a particular process
B.	periodically
C.	atomically
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

269.	What does D in the D-flip flop stand for?
A.	digital
B.	direct
C.	delay
D.	durable
Answer» D. durable

Discussion

270.	Concurrent access to shared data may result in
A.	data consistency
B.	data insecurity
C.	data inconsistency
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

271.	In segmentation, each address is specified by
A.	a segment number & offset
B.	an offset & value
C.	a value & segment number
D.	a key & value
Answer» B. an offset & value

Discussion

272.	What is a dedicated device?
A.	opposite to a sharable device
B.	same as a sharable device
C.	can be used concurrently by several processes
D.	none of the mentioned
Answer» B. same as a sharable device

Discussion

273.	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
Answer» B. all processes are contained in a single contiguous section of memory

Discussion

274.	Memory protection in a paged environment is accomplished by
A.	protection algorithm with each page
B.	restricted access rights to users
C.	restriction on page visibility
D.	protection bit with each page
Answer» E.

Discussion

275.	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
Answer» D. empty, lot

Discussion

276.	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
Answer» B. processes that have previously been in the system

Discussion

277.	‘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
B.	may occur
C.	has to occur
D.	none of the mentioned
Answer» B. may occur

Discussion

278.	When one thread immediately terminates the target thread, it is called
A.	asynchronous cancellation
B.	systematic cancellation
C.	sudden termination
D.	deferred cancellation
Answer» B. systematic cancellation

Discussion

279.	The two phase locking protocol consists of
A.	growing & shrinking phase
B.	shrinking & creation phase
C.	creation & growing phase
D.	destruction & creation phase
Answer» B. shrinking & creation phase

Discussion

280.	When is the Many to One model at an advantage?
A.	when the program does not need multithreading
B.	when the program has to be multi- threaded
C.	when there is a single processor
D.	none of the mentioned
Answer» B. when the program has to be multi- threaded

Discussion

281.	The data structures available in the Banker’s algorithm are
A.	available
B.	need
C.	allocation
D.	all of the mentioned
Answer» E.

Discussion

282.	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
Answer» B. it selects processes which have to be executed next and allocates cpu

Discussion

283.	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
Answer» C. Neither Physical nor Logical

Discussion

284.	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» C. essential condition

Discussion

285.	Every address generated by the CPU is divided into two parts. They are
A.	frame bit & page number
B.	page number & page offset
C.	page offset & frame bit
D.	frame offset & page offset
Answer» C. page offset & frame bit

Discussion

286.	What is a semaphore?
A.	is a binary mutex
B.	must be accessed from only one process
C.	can be accessed from multiple processes
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

287.	Thrashing the CPU utilization.
A.	increases
B.	keep constant
C.	decreases
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

288.	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» B. 4 philosophers and 5 chopsticks

Discussion

289.	A character stream 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» B. block of bytes as a unit

Discussion

290.	Size of the memory mainly depends on the size of the address bus.
A.	main
B.	virtual
C.	secondary
D.	cache
Answer» B. virtual

Discussion

291.	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
Answer» B. to provide the interface between the api and application program

Discussion

292.	Each entry in a segment table has a
A.	segment base
B.	segment peak
C.	segment value
D.	none of the mentioned
Answer» B. segment peak

Discussion

293.	Any electronic holding place where data can be stored and retrieved later whenever required is
A.	memory
B.	drive
C.	disk
D.	circuit
Answer» B. drive

Discussion

294.	What is the reason for using the LFU page replacement algorithm?
A.	an actively used page should have a large reference count
B.	a less used page has more chances to be used again
C.	it is extremely efficient and optimal
D.	all of the mentioned
Answer» B. a less used page has more chances to be used again

Discussion

295.	A process having multiple threads of control implies
A.	it can do more than one task at a time
B.	it can do only one task at a time, but much faster
C.	it has to use only one thread per process
D.	none of the mentioned
Answer» B. it can do only one task at a time, but much faster

Discussion

296.	The header and trailer of a sector contain information used by the disk controller such as and
A.	main section & disk identifier
B.	error correcting codes (ecc) & sector number
C.	sector number & main section
D.	disk identifier & sector number
Answer» C. sector number & main section

Discussion

297.	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
Answer» B. that can be used by more than one process at a time

Discussion

298.	In UNIX, the system call is used to send a signal.
A.	sig
B.	send
C.	kill
D.	sigsend
Answer» D. sigsend

Discussion

299.	Write ahead logging is a way
A.	to ensure atomicity
B.	to keep data consistent
C.	that records data on stable storage
D.	all of the mentioned
Answer» E.

Discussion

300.	The ability to execute a program that is only partially in memory has benefits like
A.	the amount of physical memory cannot put a constraint on the program
B.	programs for an extremely large virtual space can be created
C.	throughput increases
D.	all of the mentioned
Answer» E.

Discussion

Explore topic-wise MCQs in Technical Programming.

Multithreading on a multi – CPU machine

In question 2, if the number of page frames is increased to 4, then the number of page transfers

Winchester disks are a type of

An edge from process Pi to Pj in a wait for graph indicates that

Memory management technique in which system stores and retrieves data from secondary storage for use in main

storage is a system where a robotic arm will connect or disconnect off- line mass storage media according to the computer operating system demands.

Brain of computer is

What is Response time?

LRU page – replacement algorithm associates with each page the

Mutual exclusion implies that

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called

What does RAID stand for?

controller sends the command placed into it, via messages to the controller.

Magnetic tape drives can write data at a speed disk drives.

The offset ‘d’ of the logical address must be

Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?

Cancelling a thread asynchronously

TestAndSet instruction is executed

What does D in the D-flip flop stand for?

Concurrent access to shared data may result in

In segmentation, each address is specified by

What is a dedicated device?

In contiguous memory allocation

Memory protection in a paged environment is accomplished by

If all processes I/O bound, the ready queue will almost always be and the Short term Scheduler will have a to do.

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.

‘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

When one thread immediately terminates the target thread, it is called

The two phase locking protocol consists of

When is the Many to One model at an advantage?

The data structures available in the Banker’s algorithm are

What is a long-term scheduler?

The address generated by the CPU is referred to as

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?

Every address generated by the CPU is divided into two parts. They are

What is a semaphore?

Thrashing the CPU utilization.

The dining – philosophers problem will occur in case of

A character stream device transfers

Size of the memory mainly depends on the size of the address bus.

What is the main function of the command interpreter?

Each entry in a segment table has a

Any electronic holding place where data can be stored and retrieved later whenever required is

What is the reason for using the LFU page replacement algorithm?

A process having multiple threads of control implies

The header and trailer of a sector contain information used by the disk controller such as and

What is a reusable resource?

In UNIX, the system call is used to send a signal.

Write ahead logging is a way

The ability to execute a program that is only partially in memory has benefits like