πŸ’»

Operating System MCQs

1K+ questions with answers

251

Swap space is allocated ____________

a as a chunk of disk
b separate from a file system
c into a file system
d all of the mentioned
Medium
View Details β†’
252

CPU fetches the instruction from memory according to the value of ____________

a program counter
b status register
c instruction register
d program status word
Medium
View Details β†’
253

A memory buffer used to accommodate a speed differential is called ____________

a stack pointer
b cache
c accumulator
d disk buffer
Medium
View Details β†’
254

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
Medium
View Details β†’
255

Run time mapping from virtual to physical address is done by ____________

a Memory management unit
b CPU
c PCI
d None of the mentioned
Medium
View Details β†’
256

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
Medium
View Details β†’
257

The address of a page table in memory is pointed by ____________

a stack pointer
b page table base register
c page register
d program counter
Medium
View Details β†’
258

The page table contains ____________

a base address of each page in physical memory
b page offset
c page size
d none of the mentioned
Medium
View Details β†’
259

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
Medium
View Details β†’
260

Operating System maintains the page table for ____________

a each process
b each thread
c each instruction
d each address
Medium
View Details β†’
261

The main memory accommodates ____________

a operating system
b cpu
c user processes
d all of the mentioned
Medium
View Details β†’
262

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
Medium
View Details β†’
263

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
Medium
View Details β†’
264

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 the mentioned
Medium
View Details β†’
265

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 the mentioned
Medium
View Details β†’
266

The operating system and the other processes are protected from being modified by an already running process because ____________

a they are in different memory spaces
b they are in different logical addresses
c they have a protection algorithm
d every address generated by the CPU is being checked against the relocation and limit registers
Medium
View Details β†’
267

Using transient code, _______ the size of the operating system during program execution.

a increases
b decreases
c changes
d maintains
Medium
View Details β†’
268

When memory is divided into several fixed sized partitions, each partition may contain ________

a exactly one process
b at least one process
c multiple processes at once
d none of the mentioned
Medium
View Details β†’
269

In fixed size partition, the degree of multiprogramming is bounded by ___________

a the number of partitions
b the CPU utilization
c the memory size
d all of the mentioned
Medium
View Details β†’
270

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
Medium
View Details β†’
271

In internal fragmentation, memory is internal to a partition and ____________

a is being used
b is not being used
c is always used
d none of the mentioned
Medium
View Details β†’
272

A solution to the problem of external fragmentation is ____________

a compaction
b larger memory space
c smaller memory space
d none of the mentioned
Medium
View Details β†’
273

Another solution to the problem of external fragmentation problem is to ____________

a permit the logical address space of a process to be noncontiguous
b permit smaller processes to be allocated memory at last
c permit larger processes to be allocated memory at last
d all of the mentioned
Medium
View Details β†’
274

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
Medium
View Details β†’
275

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
Medium
View Details β†’
276

__________ is generally faster than _________ and _________

a first fit, best fit, worst fit
b best fit, first fit, worst fit
c worst fit, best fit, first fit
d none of the mentioned
Medium
View Details β†’
277

External fragmentation will not occur when?

a first fit is used
b best fit is used
c worst fit is used
d no matter which algorithm is used, it will always occur
Medium
View Details β†’
278

Sometimes the overhead of keeping track of a hole might be ____________

a larger than the memory
b larger than the hole itself
c very small
d all of the mentioned
Medium
View Details β†’
279

When the memory allocated to a process is slightly larger than the process, then ____________

a internal fragmentation occurs
b external fragmentation occurs
c both internal and external fragmentation occurs
d neither internal nor external fragmentation occurs
Medium
View Details β†’
280

Physical memory is broken into fixed-sized blocks called ________

a frames
b pages
c backing store
d none of the mentioned
Medium
View Details β†’
281

Logical memory is broken into blocks of the same size called _________

a frames
b pages
c backing store
d none of the mentioned
Medium
View Details β†’
282

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
Medium
View Details β†’
283

The __________ is used as an index into the page table.

a frame bit
b page number
c page offset
d frame offset
Medium
View Details β†’
284

The _____ table contains the base address of each page in physical memory.

a process
b memory
c page
d frame
Medium
View Details β†’
285

The size of a page is typically ____________

a varied
b power of 2
c power of 4
d none of the mentioned
Medium
View Details β†’
286

With paging there is no ________ fragmentation.

a internal
b external
c either type of
d none of the mentioned
Medium
View Details β†’
287

The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.

a page
b mapping
c frame
d memory
Medium
View Details β†’
288

Paging increases the ______ time.

a waiting
b execution
c context – switch
d all of the mentioned
Medium
View Details β†’
289

Smaller page tables are implemented as a set of _______

a queues
b stacks
c counters
d registers
Medium
View Details β†’
290

The page table registers should be built with _______

a very low speed logic
b very high speed logic
c a large memory space
d none of the mentioned
Medium
View Details β†’
291

For every process there is a __________

a page table
b copy of page table
c pointer to page table
d all of the mentioned
Medium
View Details β†’
292

Time taken in memory access through PTBR is ____________

a extended by a factor of 3
b extended by a factor of 2
c slowed by a factor of 3
d slowed by a factor of 2
Medium
View Details β†’
293

Each entry in a translation lookaside buffer (TLB) consists of ____________

a key
b value
c bit value
d constant
Medium
View Details β†’
294

If a page number is not found in the TLB, then it is known as a ____________

a TLB miss
b Buffer miss
c TLB hit
d All of the mentioned
Medium
View Details β†’
295

An ______ uniquely identifies processes and is used to provide address space protection for that process.

a address space locator
b address space identifier
c address process identifier
d none of the mentioned
Medium
View Details β†’
296

The percentage of times a page number is found in the TLB is known as ____________

a miss ratio
b hit ratio
c miss percent
d none of the mentioned
Medium
View Details β†’
297

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
Medium
View Details β†’
298

When the valid – invalid bit is set to valid, it means that the associated page ____________

a is in the TLB
b has data in it
c is in the process’s logical address space
d is the system’s physical address space
Medium
View Details β†’
299

When there is a large logical address space, the best way of paging would be ____________

a not to page
b a two level paging algorithm
c the page table itself
d all of the mentioned
Medium
View Details β†’
300

In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is?

a 3.0 ns
b 68.0 ns
c 68.5 ns
d 78.5 ns
Medium
View Details β†’