Basic Operating System MCQ
Basic Operating System MCQ
541. Load time
- Where the process will reside in memory, then absolute code can be generated
- Where the process will reside in memory, then the compilermust generate relocatable memory
- If the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time.
- all of the above.
542. Execution time
- Where the process will reside in memory, then absolute code can be memory, then absolute code can be generated
- Where the process will reside in memory, then the compiler must generate relocatable code
- if the process can be moved during the execution from one memory segment to another
- All of the above.
543. In dynamic loading
- for better memory utilization use dynamic loading
- It does not requires special support rom the operating system
- disadvantage is unused routine is never loaded
- all of the above
544. Fragmentation of the file system
- Occurs only if the file system i used improperly
- Can always be prevented
- Can be temporarily removed by compaction
- is the characterstic of all files system
545. Stub
- is included in the image for each library routine reference.
- is small piece of code that indicates how to locate the appropriate memory resident library routine
- how to load the library if the routine is not already present
- all of the above
546. Local replacement
- allows a process to select a replacement frame from the set of all frames.
- requires that each process selects from only its own set of allocated frames
- both (A) and (B) above
- none of the above
547. Thrashing
- the high paging activity
- is spending more time in paging than executing
- both A an B above
- none of the above
548. Thrashing can be avoided if
- the pages, belonging to the working set of the programs are in main memory
- the speed of CPU is increased
- the speed of I/O processor is increased
- all of the above
549. The memory allocation scheme subject to external fragmentation is
- Segmentation
- swapping
- pure demand paging
- multiple contiguous fixed partitions
550. In virtual memory systems, dynamci address translation
- is the hardware necessary to implement paging
- stores pagesat a secific ocation on a disk
- is useless when swapping is used
- is the part of the operating system paging algorithm