Operating System - Processes Questions and Answers


Operating System : Processes

The quiz have Processes Multiple Choice Questions from Operating System Section with answers and explanation.

1. Which of the following algorithm have Belady's anamoly?
[A] Optimal replacement
[D] both in FIFO and LRU

Answer: B. FIFO


In FIFO no of frames increases the page faults increases".this anamoly arised is known
as beladys anamoly.
2. For prevention of deadlock which of the following algorithm should be used
[A] Banker’s algorithm
[C] Paging

Answer: A. Banker’s algorithm

3. Non­-Preemptive algorithm is
[B] Round Robin

Answer: C. FIFO


Non­Preemption algorithm doesn’t interrupt the processes at the time of execution.
4. Ms-­Dos is a type of
[A] Multiuser OS
[B] Time sharing OS
[C] Single user OS
[D] Hybrid OS

Answer: C. Single user OS

5. Execute more jobs in the same time is
[A] Multiprogramming System
[B] Time sharing System
[C] Distributed System
[D] Hybrid Systems

Answer: A. Multiprogramming System

6. Mutual Exclusion is not the condition of
[A] To transferring a file
[B] Semaphore
[C] Deadlock
[D] Paging

Answer: C. Deadlock


No Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait these are the four necessary conditions.
7. A collection of software routines are called
[A] Hardware
[B] Operating System
[C] Data files
[D] Multiprogramming

Answer: B. Operating System

8. Necessary Conditions for deadlock can occur
[A] No Mutual Exclusion, Hold and Wait, Circular Wait, Preemption.
[B] No Mutual Exclusion, Circular Wait,Preemption, Hold and Wait..
[C] No Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait.
[D] No Preemption, No Mutual Exclusion,Hold and Wait, Circular Wait.

Answer: C. No Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait.

9. Kernel is not done by
[A] kernel level thread
[B] user level thread
[C] process
[D] none of the mentioned

Answer: B. user level thread


User level threads are managed by thread library and the kernel in unaware of them.
10. Occurrence of dining – philosophers problem
[A] 5 philosophers and 5 chopsticks
[B] 4 philosophers and 5 chopsticks
[C] 3 philosophers and 5 chopsticks
[D] 6 philosophers and 5 chopsticks

Answer: A. 5 philosophers and 5 chopsticks

Are these questions helpful for you?

Comments: (Your feedback is valuable to us)