Home > Computer Engineering > Quizzes > Operating Systems: Process synchronization
Operating Systems: Process synchronization
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 26% • Most missed: “A situation where several processes access and manipulate the same data concurre…”
Operating Systems: Process synchronization
Time left 00:00
25 Questions

1. Which of the following conditions must be satisfied to solve the critical section problem?
2. A collection of instructions that performs a single logical function is called ____________
3. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________
4. A binary semaphore is a semaphore with integer values ____________
5. The growing phase is a phase in which?
6. The shrinking phase is a phase in which?
7. Semaphore is a/an _______ to solve the critical section problem.
8. What is a mutex?
9. In the bounded buffer problem ____________
10. In the bounded buffer problem, there are the empty and full semaphores that ____________
11. The two phase locking protocol consists of ____________
12. A deadlock free solution to the dining philosophers problem ____________
13. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?I) 2-phase lockingII) Timestamp ordering
14. Which is the process of invoking the wait operation?
15. In the bakery algorithm to solve the critical section problem ____________
16. Spinlocks are intended to provide __________ only.
17. A terminated transaction that has completed its execution successfully is ____________ otherwise it is __________
18. The bounded buffer problem is also known as ____________
19. The signal operation of the semaphore basically works on the basic _______ system call.
20. Write ahead logging is a way ____________
21. The code that changes the value of the semaphore is ____________
22. The dining '
23. Which of the following statements describes properties achieved?
24. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________
25. How many different values of X are possible after both processes finish executing?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.