तीन मेमोरी फ्रेम वाले एक सिस्टम और निम्नलिखित पेज संदर्भों के अनुक्रम पर विचार करें: 2, 1, 2, 3, 5, 4, 1, 3, 4, 2, 1 यदि सेकंड-चांस पेज रिप्लेसमेंट एल्गोरिदम का उपयोग किया जाता है, तो कितने पेज फॉल्ट होंगे?

Consider a system with four processes and four resources: P1 holds R1 and requests R2 P2 holds R2 and requests R3 P3 holds R3 and requests R4 P4 holds R4 and requests R2 Each resource has exactly one instance. Which statement is correct?

A system has 18 instances of a single resource type, shared among n processes. If each process requires at most 5 instances, what is the maximum value of n for which the system can guarantee that a deadlock will never occur?