Скачать или смотреть 3.19 Each process Pi, i = 1 9 is coded as followsrepeatP(mutex){critical section}V(mutex)forever....

Notes of this video...
This note contains notes from 3.7 to ......
https://drive.google.com/file/d/1gMV5...

Subscribe to our channel for more videos...
   / @shishirshiva  

In this video,we will solve a gate peoblem
Question : Each process Pi, i = 1 9 is coded as follows

repeat

P(mutex)

{critical section}

V(mutex)

forever

The code for P10 is identical except that it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment?

(a) 1

(c) 3

(b) 2

(d) None of these

[1997: 2 Marks]
.
.
.
.
#operatingsystem #operatingsystemlectures #operatingsystemplaylist #GATE #computerscience #aktu #GATEcse #gatelectures #aktulectures #operatingsysteminhindi #operating_system #operatingsystemtutorials #operatingsystemtutorialsinhindi #gateexam #gatepyqs #gatecsepyq
#gatepyq