OPERATING SYSTEM MCQS PART 02
1. The term ‘page traffic’ describes
(A) number of pages in memory at a given instant.
(B) number of papers required to be brought in at a given page request.
(C) the movement of pages in and out of memory.
(D) number of pages of executing programs loaded in memory.
Ans: (C)
2. The “turn-around” time of a user job is the
(A) time since its submission to the time its results become available.
(B) time duration for which the CPU is allotted to the job.
(C) total time taken to execute the job.
(D) time taken for the job to move from assembly phase to completion phase.
Ans: (C)
3. Which of the following can be used as a criterion for classification of data structures used in language processing.
(A) nature of a data structure
(B) purpose of a data structure
(C) lifetime of a data structure
(D) all of the above.
Ans: (D)
4. Memory utilization factor shall be computed as follows
(A) memory in use/allocated memory.
(B) memory in use/total memory connected.
(C) memory allocated/free existing memory.
(D) memory committed/total memory available.
Ans: (B)
5. Program ‘preemption’ is
(A) forced de allocation of the CPU from a program which is executing on the CPU.
(B) release of CPU by the program after completing its task.
(C) forced allotment of CPU by a program to itself.
(D) a program terminating itself due to detection of an error.
Ans: (A)
6. An assembler is
(A) programming language dependent.
(B) syntax dependant.
(C) machine dependant.
(D) data dependant.
Ans: (C)
7. Which of the following is not a fundamental process state
(A) ready
(B) terminated
(C) executing
(D) blocked
Ans: (D)
8. ‘LRU’ page replacement policy is
(A) Last Replaced Unit.
(B) Last Restored Unit.
(C) Least Recently Used.
(D) Least Required Unit.
Ans: (C)
9. Which of the following is true?
(A) Block cipher technique is an encryption technique.
(B) Steam cipher technique is an encryption technique.
(C) Both (A) and (B)
(D) Neither of (A) and (B).
Ans: (C)
10. Which of the following approaches do not require knowledge of the system state?
(A) deadlock detection.
(B) deadlock prevention.
(C) deadlock avoidance.
(D) none of the above.
Ans: (D)
(A) number of pages in memory at a given instant.
(B) number of papers required to be brought in at a given page request.
(C) the movement of pages in and out of memory.
(D) number of pages of executing programs loaded in memory.
Ans: (C)
2. The “turn-around” time of a user job is the
(A) time since its submission to the time its results become available.
(B) time duration for which the CPU is allotted to the job.
(C) total time taken to execute the job.
(D) time taken for the job to move from assembly phase to completion phase.
Ans: (C)
3. Which of the following can be used as a criterion for classification of data structures used in language processing.
(A) nature of a data structure
(B) purpose of a data structure
(C) lifetime of a data structure
(D) all of the above.
Ans: (D)
4. Memory utilization factor shall be computed as follows
(A) memory in use/allocated memory.
(B) memory in use/total memory connected.
(C) memory allocated/free existing memory.
(D) memory committed/total memory available.
Ans: (B)
5. Program ‘preemption’ is
(A) forced de allocation of the CPU from a program which is executing on the CPU.
(B) release of CPU by the program after completing its task.
(C) forced allotment of CPU by a program to itself.
(D) a program terminating itself due to detection of an error.
Ans: (A)
6. An assembler is
(A) programming language dependent.
(B) syntax dependant.
(C) machine dependant.
(D) data dependant.
Ans: (C)
7. Which of the following is not a fundamental process state
(A) ready
(B) terminated
(C) executing
(D) blocked
Ans: (D)
8. ‘LRU’ page replacement policy is
(A) Last Replaced Unit.
(B) Last Restored Unit.
(C) Least Recently Used.
(D) Least Required Unit.
Ans: (C)
9. Which of the following is true?
(A) Block cipher technique is an encryption technique.
(B) Steam cipher technique is an encryption technique.
(C) Both (A) and (B)
(D) Neither of (A) and (B).
Ans: (C)
10. Which of the following approaches do not require knowledge of the system state?
(A) deadlock detection.
(B) deadlock prevention.
(C) deadlock avoidance.
(D) none of the above.
Ans: (D)
No comments:
Post a Comment