## Forum Replies Created

- Ajay KumarMember
can u tell me how did u get this 3 as the correct answer ..

OR in which book did u seen this answer? so that i will check there is one more formula

related to this type of problem in GATE CS 1993 paper S<(m+n) where s = max requirement of all processes

m = number of resources

n = number of processesNov 23, 2011 at 6:14 pm

- Ajay KumarMember
Anusha : here they are asking minimum number of R so its obviously 4 only in ur choice in the list (4, 5,6)

Any way its my own formula. it is not in any text book . u can apply and check and reply backNov 22, 2011 at 4:46 pm

- Ajay KumarMember
@Anusha : here they are asking minimum number of R so its obviously 4 only in ur choice in the list (4, 5,6)

Nov 22, 2011 at 4:38 pm

- Ajay KumarMember
its simple formula :

N*D<R+N where N= total number of processes , D= each process need

R= resoures available

so in this problem N= 'N' number of processes

D=3 and R=6

so N*3<6+N

so 3N<6+N by solving this equation u will get

2N<6 therefore N<3 so N should be less than 3 so N=2Nov 21, 2011 at 5:21 pm

- Ajay KumarMember
u can use this formula for ur previous problem also…..

Nov 21, 2011 at 5:12 pm

- Ajay KumarMember
its simple formula :

N*D<R+N where N= total number of processes , D= each process need

R= resoures available

so in this problem N= 'N' number of processes

D=3 and R=6

so N*3<6+N

so 3N<6+N by solving this equation u will get

2N N<3

therefore N should be 2

u can aply this formula for other GATE 1998 CS and GATE 2005 CSNov 21, 2011 at 5:00 pm

IISc uploaded the Defective gate applications details .check out soon