## Forum Replies Created

- Anusha KurraMember
@lorin ahmed

i am unable to understand the logic u are trying to tell… can u plzz tell me in imple way..plzz

Nov 23, 2011 at 5:39 pm

- Anusha KurraMember
@lorin ahmed

i am unable to understand the logic u are trying to tell… can u plzz tell me in imple way..plzz- This reply was modified 10 years, 2 months ago by Anusha Kurra.

Nov 23, 2011 at 5:38 pm

- Anusha KurraMember
heyy for the problem u solved on the other day

A computer has 6 tape drives with N process competing for them.. each process need 3 drives… then the max value for N to b deadlock free is??????

u solved using that formulae…which was 2

but correct answer is 3.if any 1 knw the solution fot this plzz tell the solution

Nov 23, 2011 at 5:37 pm

- Anusha KurraMember
An operating system contains 3 user processes each requiring 2 units of resource R .The minimum number of units of R such that no deadlocks will ever arise is

ans is given as 4 . i want the solution to solve this??????if we apply the formulae in the other link

then 3*2<3+R

6<3+R

3<R

SO CHOICES ARE GIVEN AS FOLLOWS 4,5,6

the above three options are satisfies so how can we knw 4 is the right answerNov 22, 2011 at 2:51 pm

- Anusha KurraMember
if we apply the formulae in the other link

then 3*2<3+R

6<3+R

3<R

SO CHOICES ARE GIVEN AS FOLLOWS 4,5,6

the above three options are satisfies so how can we knw 4 is the right answerNov 22, 2011 at 2:51 pm

- Anusha KurraMember
An operating system contains 3 user processes each requiring 2 units of resource R .The minimum number of units of R such that no deadlocks will ever arise is

ans is given as 4 . i want the solution to solve this??????Nov 21, 2011 at 10:23 am

- Anusha KurraMember
yea.. i kinda got it but wen i apply the same logic to some pblms i am not able to find solution .. so plz hlp me with following pblms

A computer has 11 tape drives with N process competing for them.. each process need 3 drives… then the max value for N to b deadlock free is??????

A computer has 6 tape drives with N process competing for them.. each process need 3 drives… then the max value for N to b deadlock free is??????Nov 21, 2011 at 9:59 am

- Anusha KurraMember
free.the question is

a computer has 6 tape drives with N process competing for them.. each process need 2 drives… then the max value for N to b deadlock free is??????

plzz temme hw to find solution for thisNov 20, 2011 at 11:16 am

- Anusha KurraMember
hiee everyone.. i have question in o.s i.e hw to find dead lock free.the question is

a computer has 6 tape drives with N process competing for them.. each process need 2 drives… then the max value for N to b deadlock free is??????

plzz temme hw to find solution for thisNov 20, 2011 at 11:15 am

what is the output if fn(7) is called?

fn(int v)

{

if(v==1||v==0)

return 1;

elseif(v%2==0)

return fn(v/2)+5;

else

return fn(v-1)+3;

}

i think ans is 17.is it correct