Gate 2006 IT Q82,83

Moderator: CS Moderators Team

Gate 2006 IT Q82,83

Postby JamesBond » Mon Dec 12, 2011 4:47 pm

A software project has four phases P1,P2,P3 and P4. Of these phases,P1 is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until tboth P2 and P3 are completed. the Optimistic, most likely and pessimistic estimates of the phase completion times in days for P1,P2,P3,P4 are respectively (11,15,25)(7,8,15),(8,9,22) and (3,8,19)

Q82) The critical path for the above project and the slack of P2 are respectively?
a)P1-P2-P4, 1day
b)P1-P3-P4, 1 day
c)P1-P3-P4, 2 days
d) P1-P2-P4, 2 days

Q83) The costs( in Rupees per day) of crashing the expected phase completion times for the four phases respectively are 100, 2000, 50 and 1000. Assume that the expected phase completion times of the phases cannot be crashed below their respective most likely completion times. The minimum and the maximum amounts(in Rupees) that can be spent on crashing so that ALL paths are critical are respectively
a)100 and 1000
b)100 and 1200
c)150 and 1200
d)200 and 2000
JamesBond
Gatementor Regular
Gatementor Regular
 
Posts: 257
Joined: Thu Jul 07, 2011 10:13 am
My College/Company:: IIT DELHI
Roll Number: 9999999
City: delhi

Re: Gate 2006 IT Q82,83

Postby gateworm » Sat Jul 19, 2014 11:46 pm

Ans: P1-P3-P4,2 days
and Min cost=100
Max Cost =1200

First calculate Estimated time Using formula :
estimated=(optimistic+4*most likely+pessimistic)/6


Now you have Optimistic Most Likely Estimated Cost

In order to find the cost ---->make all paths critical
Min cost=crash P3 by 2 days
=2*50=100
Max cost=crash P1 by 1 day +P3 by 2 days+P4 by 1 day
=100 + 50*2 + 1000
=1200

Hope this will help you.
gateworm
 
Posts: 3
Joined: Sat Jul 19, 2014 11:20 pm
My College/Company:: IITDelhi
Roll Number: 0


Return to Software Engineering

Who is online

Users browsing this forum: No registered users and 3 guests