Threads of the same process share:

4 processes each need max 5 resources. Total resources = 16. Deadlock:

Consider the following code:

while (TestAndSet(lock));

What is the main issue with this implementation?

Given Process P1(AT=0,BT=8), P2(AT=1,BT=4), P3(AT=2,BT=2)

The algorithm is SRTF. Which process executes at time t = 2?

S1 = 1, S2 = 2

Processes:

• P1: wait(S1), wait(S2)

• P2: wait(S2), wait(S1)

• P3: wait(S2)

Maximum processes in deadlock:

Consider:

P1: wait(A); wait(B);
P2: wait(B); wait(A);

This leads to:

Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20KB,4 KB, 25 KB,18 KB,7 KB,9 KB,15 KB, and 12 KB. Assume that no two holes are adjacent. Two processes P1 of size 16 KB and P2 of size 9 KB arrive in that order, and they are allocated memory using the best-fit technique. After allocating space to P1 and P2, the number of holes of size less than 8 KB is . (answer in integer)