adplus-dvertising

Welcome to the Process Synchronization MCQs Page

Dive deep into the fascinating world of Process Synchronization with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Process Synchronization, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of Process Synchronization, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Process Synchronization. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Process Synchronization. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Process Synchronization MCQs | Page 4 of 15

Discuss
Answer: (c).there is a mailbox to help communication between P and Q
Discuss
Answer: (b).the sending process sends the message and resumes operation
Discuss
Answer: (c).both a and b
Discuss
Answer: (b).is referred to as a message system with no buffering
Q35.
Bounded capacity and Unbounded capacity queues are referred to as :
Discuss
Answer: (b).Automatic buffering
Discuss
Answer: (c).to do inter process communication
Discuss
Answer: (c).where shared resources are accessed  
Q38.
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.
Method Used by P1:
while (S1 == S2) ;
Critica1 Section
S1 = S2;

Method Used by P2:
while (S1 != S2) ;
Critica1 Section
S2 = not (S1);

Which one of the following statements describes the properties achieved?
Discuss
Answer: (a).Mutual exclusion but not progress
Q39.
A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is
Discuss
Answer: (b).8
Q40.
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1, S1=0, S2=0.
Process P0 :
while (true) {
wait (S0);
print (0);
release (S1);
release (S2);
}

Process P1 :
wait (S1);
Release (S0);

Process P2 :
wait (S2);
release (S0);
How many times will process P0 print '0'?
Discuss
Answer: (a).At least twice
Page 4 of 15

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!