GATE & PSUs - Computer Science & Information Technology (CS & IT)

Memory Management, Paging & Segmentation question bank (Operating Systems)

Practice 6 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Operating Systems - Memory Management, Paging & Segmentation questions with answers and step-by-step solutions.

Start free Book a demo

All Hard Medium

Q1.

[Memory Management, Paging & Segmentation Concept 4] Consider three processes $P_1, P_2, P_3$ sharing two resources $R_1, R_2$ with single instances each. Under which condition can a deadlock state occur?

(A)

Mutual exclusion, Hold and wait, No preemption, and Circular wait all hold simultaneously.

(B)

Processes request resources only in strictly increasing numeric order of resource indices.

(C)

Preemption of allocated resources is dynamically permitted by the OS scheduler.

(D)

The resource allocation graph is bipartite and completely cycle-free.

Show answer & solution

Verified Answer & Solution Locked

Q2.

[Memory Management, Paging & Segmentation Concept 10] Consider three processes $P_1, P_2, P_3$ sharing two resources $R_1, R_2$ with single instances each. Under which condition can a deadlock state occur?

(A)

Mutual exclusion, Hold and wait, No preemption, and Circular wait all hold simultaneously.

(B)

Processes request resources only in strictly increasing numeric order of resource indices.

(C)

Preemption of allocated resources is dynamically permitted by the OS scheduler.

(D)

The resource allocation graph is bipartite and completely cycle-free.

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 6 Questions in Memory Management, Paging & Segmentation

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 6 questions

Unlock every Memory Management, Paging & Segmentation question, generate papers, and practice at your own pace.

Start free