For the following questions answer them individually
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require ?
Which of the following need not necessarily be saved on a Context Switch between processes?
Consider a logical address space of 8 pages of.1024 words mapped into memory of 32 frames. How manybits are there in the logical address?
Which of the following class of statement usually produces no executable code when compiled?
What is the value of F(4) using the following procedure:
function F(k : integer):
integer;
begin
if(K < 3) then F := k else F := F(k - 1) * F(k - 2) + F(k - 3)
end;
Stack A hasthe entries a, b, c (with a on top). Stack B is empty. An entry popped outof stack A can be printed immediately or pushedto stack B. An entry popped out of the stack B can only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?