Deadlock Avoidance MCQ 1. The content of the matrix Need is ____________ a) Allocation – Available b) Max – Available c) Max – Allocation d) Allocation – Max Answer: Max – Allocation 2. A state is safe, if ____________ a) the system does not crash due to deadlock occurrence b) the system can allocate resources to each process in some order and still avoid a deadlock c) the state keeps the system protected and safe d) all of the mentioned Answer: the system can allocate resources to each process in some order and still avoid a deadlock 3. If no cycle exists in the resource allocation graph ____________ a) then the system will not be in a safe state b) then the system will be in a safe state c) all of the mentioned d) none of the mentioned Answer: then the system will be in a safe state 4. All unsafe states are ____________ a) deadlocks b) not deadlocks c) fatal d) none of the mentioned Answer: not deadlocks 5. The data structures available in the Banker’s algorithm are ____________ a)

Multiple Choice Questions & Answers on Virtual Memory Virtual Memory MCQ 1. In FIFO page replacement algorithm, when a page must be replaced ____________ a) oldest page is chosen b) newest page is chosen c) random page is chosen d) none of the mentioned Answer: oldest page is chosen 2. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then ____________ a) segmentation fault occurs b) fatal error occurs c) page fault occurs d) no error occurs Answer: page fault occurs 3. Working set model for page replacement is based on the assumption of ____________ a) modularity b) locality c) globalization d) random access Answer: locality 4. Swap space exists in ____________ a) primary memory b) secondary memory c) cpu d) none of the mentioned Answer: secondary memory 5. Because of virtual memory, the memory can be shared among ____________ a) processes b) threads c) instructions d) none of the mentioned Answer: processes 6. The pager conce

Multiple Choice Questions & Answers on Memory Management Memory Management MCQ  1. The address of a page table in memory is pointed by ____________ a) stack pointer b) page table base register c) page register d) program counter Answer: page table base register 2. Run time mapping from virtual to physical address is done by ____________ a) Memory management unit b) CPU c) PCI d) None of the mentioned Answer: Memory management unit Software Architect's >> 3. Operating System maintains the page table for ____________ a) each process b) each thread c) each instruction d) each address Answer: each process 4. The page table contains ____________ a) base address of each page in physical memory b) page offset c) page size d) none of the mentioned Answer: base address of each page in physical memory 5. CPU fetches the instruction from memory according to the value of ____________ a) program counter b) status register c) instruction register d) program status word Answer: program

Multiple Choice Questions & Answers on OS Deadlock Deadlock MCQ 1. The circular wait condition can be prevented by ____________ a) defining a linear ordering of resource types b) using thread c) using pipes d) all of the mentioned Answer: defining a linear ordering of resource types 2. A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________ a) deadlock b) starvation c) inversion d) aging Answer: starvation Operating Systems: Concepts >> 3. A system is in the safe state if ____________ a) the system can allocate resources to each process in some order and still avoid a deadlock b) there exist a safe sequence c) all of the mentioned d) none of the mentioned Answer: the system can allocate resources to each process in some order and still avoid a deadlock 4. To avoid deadlock ____________ a) there must be a fixed number of resources to allocate b) resource allocation must be done only once c) all deadlocked processe

Multiple Choice Questions & Answers on CPU Scheduling CPU Scheduling MCQ 1. In priority scheduling algorithm ____________ a) CPU is allocated to the process with highest priority b) CPU is allocated to the process with lowest priority c) Equal priority processes can not be scheduled d) None of the mentioned Answer: CPU is allocated to the process with highest priority 2. Process are classified into different groups in ____________ a) shortest job scheduling algorithm b) round robin scheduling algorithm c) priority scheduling algorithm d) multilevel queue scheduling algorithm Answer: multilevel queue scheduling algorithm Introduction to CPU Scheduling Algorithms 3. The interval from the time of submission of a process to the time of completion is termed as ____________ a) waiting time b) turnaround time c) response time d) throughput Answer: turnaround time 4. In multilevel feedback scheduling algorithm ____________ a) a process can move to a different classified ready queue b) cla

Multiple Choice Questions & Answers on Operating System Process Management 1. What is the main function of the command interpreter? a) to get and execute the next user-specified command b) to provide the interface between the API and application program c) to handle the files in operating system d) none of the mentioned Answer: to get and execute the next user-specified command 2. What is an operating system? a) collection of programs that manages hardware resources b) system service provider to the application programs c) interface between the hardware and application programs d) all of the mentioned Answer: all of the mentioned 3. Which one of the following is not true? a) kernel is the program that constitutes the central core of the operating system b) kernel is the first part of operating system to load into memory during booting c) kernel is made of various modules which can not be loaded in running operating system d) kernel remains in the memory during the entire computer s