Operating System Multiple Choice Questions and Answers pdf free download

1.  Translator for low level programming language were termed as ______.  
2.  Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as  
3.  Load address for the first word of the program is called   
4.  Symbolic names can be associated with  
5.  The translator which perform macro expansion is called a    
6.  Shell is the exclusive feature of  
7.  A program in execution is called _____.
8.  Interval between the time of submission and completion of the job is called   
9.  A scheduler which selects processes from secondary  storage device is called   
10. The scheduling in which CPU is allocated to the process with least CPU-burst time is called  
11. The term ‘page traffic’ describes  
12. The “turn-around” time of a user job is the  
13. Which of the following can be used as a criterion for classification of data structures used in language processing.  
14. Memory utilization factor shall be computed as follows  
15. Program ‘preemption’ is  
16. An assembler is ______.
17. Which of the following is not a fundamental process state 
18. ‘LRU’ page replacement policy is  
19. Which of the following is true?   
20. Which of the following approaches do not require knowledge of the system state?  
21. Program generation activity aims at 
22. Which amongst the following is not an advantage of Distributed systems?   
23. An imperative statement   
24. Which of the following loader is executed when a system is first turned on or restarted 
25. Poor response time is usually caused by  
26. “Throughput” of a system is 
27. The “blocking factor” of a file is  
28. Which of these is a component of a process precedence sequence?  
29. Which among st the following is valid syntax of the Fork and Join Primitive?  
30. Nested Macro calls are expanded using the  
31. A parser which is a variant of top-down parsing without backtracking is   
32. The expansion of nested macro calls follows  
33. In a two-pass assembler, the task of the Pass II is to   
34. A linker program  
35. Which scheduling policy is most suitable for a time-shared operating system   
36. A critical section is a program segment  
37. An operating system contains 3 user processes each  requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is 
38. Locality of reference implies that the page reference being made by a process  
39. Which of these is not a part of Synthesis phase 
40. The syntax of the assembler directive EQU is  
41. The following features are needed to implement top down parsing    
42. A macro definition consists of           
43. The main reason to encrypt a file is to _________.     
44. Which of the following is not a key piece of information, stored in single page table entry, assuming pure paging and virtual memory 
45. A UNIX device driver is  
46. The following is not a layer of IO management module  
47. Which amongst the following is not a valid page replacement policy?  
49. An assembly language is a  ______ .
50. TII stands for ______.
51. An analysis, which determines the syntactic structure of the source statement, is called 
52. Action implementing  instruction’s meaning are a actually carried out by  
53. The field that contains a segment  index or an internal index is called 
54. A program in execution is called 
55. Jobs which are admitted to the system for processing is called 
56. A set of techniques that allow to execute a program which is not entirely in  memory is called 
57. SSTF stands for ______.
58. Before proceeding with its execution, each process must acquire all the resources it needs is called 
59. Virtual memory is_______. 
60. Relocation bits used by relocating loader are specified by 
61. Resolution of externally defined symbols is performed by    
62. Relocatable programs
63. Page stealing is _______.   
64. The total time to prepare a disk drive mechanism for a block of data to be read from is its 
65. To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is 
66. The memory allocation scheme subject to “external” fragmentation is  
67. Page fault frequency in an operating system is reduced when the 
68. In which of the following page replacement policies Balady’s anomaly occurs? 
69. Which of the following are language processors?   
70. Virtual memory can be implemented with  
71. Round robin scheduling is essentially the preemptive version of ________. 
72. A page fault occurs 
73. Which of the following will determine your choice of systems software for your computer ? 
74. Let S and Q be two semaphores initialized to A., where P0 and PA. processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ . 
75. What is a shell ? 
76. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _______.
77. In the blocked state is ______.
78. What is the memory from A.K - 6D.0K called ? 
79. Virtual memory is __________. 
80. The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________. 
81. Multi programming systems ________. 
82. Which is not the state of the process ? 
83. The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting. 
84. The problem of thrashing is effected scientifically by ________. 
85. The state of a process after it encounters an I/O instruction is __________. 
86. The number of processes completed per unit time is known as __________. 
87. _________ is the situation in which a process is waiting on another process,which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress. 
88. Which of the following file name extension suggests that the file is Backup copy of another file ? 
89. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy? 
90. A critical region is _______.
91. The mechanism that bring a page into memory only when it is needed is called ______.
92. PCB = 
93. FIFO scheduling is ________. 
94. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________. 
95. Which directory implementation is used in most Operating System? 
96. ______ is a high level abstraction over Semaphore. 
97. A tree structured file directory system 
98. Which of the following is not a fundamental process state 

0 comments: