Скачать или смотреть GATE 1992 | OS | WORKING SET | PAGE REFERENCE|GATE TEST SERIES | SOLUTIONS ADDA | EXPLAINED BY VIVEK

GATE 1992 Q44: (a) Draw the precedence graph for the concurrent program given below:
S1
parbegin
begin
S2:S4
end;
begin
S3;
parbegin
S5;
begin
S6:S8
End
parend
end;
S7
parend;
S9
(b) Let the page reference and the working set window be c c d b c e c e a d and 4, respectively. The initial working set at time t = 0 contains the pages {a, d, e}, where a was referenced at time t = 0, d was referenced at time t = -1, and e was referend at time t = -2. determine the total number of page faults and the average number of page frames used by computing the working set at each reference.

Website: https://solutionsadda.in/
ISRO / DRDO PYQs: https://solutionsadda.in/isro/
GATE PYQs : https://solutionsadda.in/gate1/
NIC - NIELIT PYQs: https://solutionsadda.in/nielit/

ISRO Complete Analysis: https://solutionsadda.in/isro-complet...
NIC-NIELIT Complete Analysis: https://solutionsadda.in/nielit/
GATE Complete Analysis: https://solutionsadda.in/gate-complet...

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT
Test series : https://solutionsadda.in/test-series/

If you have any queries write a mail: [email protected]
Face Book Page:   / solutionsaddain-111628724482494  
Telegram: https://t.me/solutionsaddaforcse