Home > Computer Engineering > Quizzes > Operating Systems Practice Test: IO System
Operating Systems Practice Test: IO System
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 70% Most missed: “What are the two atomic operations permissible on semaphores?”
Operating Systems Practice Test: IO System
Time left 00:00
25 Questions

1. The bounded buffer problem is also known as ____________
2. What is a semaphore?
3. What is the main disadvantage of spinlocks?
4. The signal operation of the semaphore basically works on the basic _______ system call.
5. What are Spinlocks?
6. A monitor is a type of ____________
7. Semaphore is a/an _______ to solve the critical section problem.
8. If the semaphore value is negative ____________
9. TestAndSet instruction is executed ____________
10. In the bakery algorithm to solve the critical section problem ____________
11. A binary semaphore is a semaphore with integer values ____________
12. What will happen if a non-recursive mutex is locked more than once?
13. The dining – philosophers problem will occur in case of ____________
14. What are the two atomic operations permissible on semaphores?
15. What are the two kinds of semaphores?
16. The wait operation of the semaphore basically works on the basic _______ system call.
17. What is a mutex?
18. In the bounded buffer problem, there are the empty and full semaphores that ____________
19. At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is? (GATE 1987)
20. A deadlock free solution to the dining philosophers problem ____________
21. To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.
22. In the bounded buffer problem ____________
23. Semaphores are mostly used to implement ____________
24. Spinlocks are intended to provide __________ only.
25. An un-interruptible unit is known as ____________