1. Dijkstra's banking algorithm in an operating system solves the problem of -
Ans: Deadlock Avoidance
2. In a paged memory system, if the page size is increased, then the internal fragmentation generally -
Ans: Becomes more
3. An operating system contains 3 user processes each requiring 2 units of resources R. The minimum number of units of R such that no deadlock will ever occur is -
Ans: 4
4. Critical region is -
Ans: A set of instructions that access common shared resources which exclude one another in time
5. Kernel is -
Ans: The set of primitive functions upon which the rest of operating system functions are built up
6. Necessary conditions for deadlock are -
Ans: Non-preemption and circular wait, Mutual exclusion and partial allocation
7. In a time sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the -
Ans: READY state
8. Supervisor call -
Ans: Are privileged calls that are used to perform resource management functions, which are controlled by the operating system
9. Semaphores are used to solve the problem of -
Ans: Mutual exclusion, Process synchronization
10. If the property of locality of reference is well pronounced in a program-
Ans: The number of page faults will be less
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment