OPERATING SYSTEM MCQS PART 07
1. Resolution of externally defined symbols is performed by
(A) Linker
(B) Loader
(C) Compiler
(D) Editor
Ans: (A)
2. 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)
3. 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)
4. 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)
5. 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)
6. The memory allocation scheme subject to “external” fragmentation is
(A) segmentation
(B) swapping
(C) pure demand paging
(D) multiple fixed contiguous partitions
Ans: (A)
7. 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)
8. In which of the following page replacement policies Balady’s anomaly occurs?
(A) FIFO
(B) LRU
(C) LFU
(D) NRU
Ans: (A)
9. Which of the following are language processors?
(A) Assembler
(B) Compiler
(C) Interpreter
(D) All of the above
Ans: (D)
10. Virtual memory can be implemented with
(A) Segmentation
(B) Paging
(C) None
(D) all of the above
Ans: (D)
(A) Linker
(B) Loader
(C) Compiler
(D) Editor
Ans: (A)
2. 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)
3. 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)
4. 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)
5. 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)
6. The memory allocation scheme subject to “external” fragmentation is
(A) segmentation
(B) swapping
(C) pure demand paging
(D) multiple fixed contiguous partitions
Ans: (A)
7. 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)
8. In which of the following page replacement policies Balady’s anomaly occurs?
(A) FIFO
(B) LRU
(C) LFU
(D) NRU
Ans: (A)
9. Which of the following are language processors?
(A) Assembler
(B) Compiler
(C) Interpreter
(D) All of the above
Ans: (D)
10. Virtual memory can be implemented with
(A) Segmentation
(B) Paging
(C) None
(D) all of the above
Ans: (D)
No comments:
Post a Comment