Consider the students and teachers as processes, and there are N students and one teacher. Only one

 Consider the students and teachers as processes, and there are N students and one teacher. Only one person can access to the examination room each time. The principle of entering the examination room is “first come, first in”. Only if all the N students are in the room, the teacher can hand out the exam papers. After handing in his/her paper, the student can leave. However, only when the teacher has collected all the papers, he/she can leave.

(1) How many processes will be needed?

(2) Try to solve the above scene’s synchronization and mutex using P, V operations.

（1）需要N+1个进程

（2）定义int f=0,s=0;

teacher：

f=0

while（true）{

If(S==N){

f=1;//可以发卷了

//发卷ing

Break;

}

}

wait(mutex1);

wait(mutex2);

……

wait(mutexN);

//走人

 

Student i:

s++;

while（true）{

If(s==N&&f==1){

Wait(i);

//做题

signal（i）;

Break;//做完题就走人了

}

}