SSTF stands for
(A) Shortest-Seek-time-first scheduling
(B) small – small-time-first
(C) simple-seek-time-first
(D) small-simple-time-first scheduling
Ans: (A)
Before proceeding with its execution, each process must acquire all the resources it needs is called
(A) hold and wait (B) No pre-emption
(C) circular wait (D) starvation
Ans: (A)
Virtual memory is
(A) simple to implement
(B) used in all major commercial operating systems
(C) less efficient in utilization of memory
(D) useful when fast I/O devices are not available
Ans: (B)
Relocation bits used by relocating loader are specified by
(A) Relocating loader itself (B) Assembler or Translator
(C) Macro processor (D) Both (A) and (B)
Ans: (B)
Resolution of externally defined symbols is performed by
(A) Linker (B) Loader
(C) Compiler (D) Editor
Ans: (A)
Relocatable programs
(A) cannot be used with fixed partitions
(B) can be loaded almost anywhere in memory
(C) do not need a linker
(D) can be loaded only at one specific location
Ans: (B) Page stealing
(A) is a sign of efficient system
(B) is taking page frames other working sets
(C) should be the tuning goal
(D) is taking larger disk spaces for pages paged out
Ans: (B)
The total time to prepare a disk drive mechanism for a block of data to be read from is its
(A) latency
(B) latency plus transmission time
(C) latency plus seek time
(D) latency plus seek time plus transmission time
Ans: (C)
To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is
(A) zero (B) one
(C) two (D) more than two
Ans: (B)
The memory allocation scheme subject to “external” fragmentation is
(A) segmentation (B) swapping
(C) pure demand paging (D) multiple fixed contiguous partitions
Ans: (A)
Page fault frequency in an operating system is reduced when the
(A) processes tend to the I/O-bound
(B) size of pages is reduced
(C) processes tend to be CPU-bound
(D) locality of reference is applicable to the process
Ans: (D)
0 comments:
Post a Comment