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 12 of 15

Explore more Topics under Operating System

Q111.
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);
Critical section
S1 = S2;

Method used by P2 :
while(S1!=S2);
Critical section
S2 = not(S1);

Which of the following statements describes properties achieved ?
Discuss
Answer: (d).Both mutual exclusion and progress
Q112.
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock ?

I) 2-phase locking
II) Time-stamp ordering
Discuss
Answer: (b).II only
Q113.
The initial value of the semaphore that allows only one of the many processes to enter their critical sections, is

a.

8

b.

1

c.

16

d.

0

Discuss
Answer: (b).1
Q114.
For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Discuss
Answer: (a).synchronize critical resources to prevent deadlock
Q116.
What is the initial value of the semaphore to allow only one of the many processes to enter their critical section?

a.

8

b.

1

c.

16

d.

0

Discuss
Answer: (b).1
Q117.
Part of a program where the shared memory is accessed and which should be executed invisibly, is called
Discuss
Answer: (c).critical section
Discuss
Answer: (d).one which is enclosed by a pair of P and V operations on semaphores
Q119.
For procedure, the system prevent the overlap of buffer
Discuss
Answer: (c).Operations
Q120.
In implementation of Semaphores, for a single processor system, it is possible to inhibited
Discuss
Answer: (b).Interrupts

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!