Escolar Documentos
Profissional Documentos
Cultura Documentos
p D) DP.
x [7008] ior [Turn overASEN 72
181. gEbEO auptind Adame pniGofinc Yepeud UWEUOE Sta) oramedlé
cep) QeseH@unegg Labs QREEGREH OupLUGAcpsr
(CON aeirug s}00 8g Uguibarcyd eeleMLeSd UguTs cuengUoULL
Bon Gagar@aoher vedo ceinanféconomuny. 2 retug Lowflaefle,
ceinaAibenscounio eladlespes. )
Ay Nea B) Ne=n
c) Nea D) Nn soos N> a.
While solving an assignment problem applying Hungarian method, the optimal
assignments can be made when
(N+ minimum No. of lines drawn to cover all the zeros, n : No. of jobs }
AL Nen B) Nen
c) Neon DI NenorN>n.
182. GG QobED apiod Abad admmp SpiGar@ ALLNGES Adsoors
wnpSucovsaiuGdngs 7
A) Gi@LG wALYysned
B) Sd Algy wd leone
0) KU@UE seg BéAp) UBdYyerrads
D) GUGUG wbprd BSApy Bayer emesis dios
‘An assignment problem is converted into an LPP as
A) maximization problem
B) minimization problem
C) maximization or minimization problem
D) neither maximization nor minimization problem.
x (7004) (for)183.
184,
73 ASEN
Udticiqgucrappc: GE cores Qamiy csopu.sélr Ienpurs orange og 7
A) #@@ @geubp evened
B), | gaiGlang Geugid gSpOurG sbyseDurd EPsasuodog
©) “QGy (pera Ystofurss GGGog Qewsach sor wren sro Garflorenor
D) ga@ang Geugmsed sec er@pmi Geuds Opgoflersd
(amedn Bat Oot orgy
Which one of the following is an error is a network diagram ?
a yan endless loop
B)" 4 Each activity is represented by only one arrow
C)_ {No two activities are identified by same end points
D) | Asuce
‘or activity is clearly shown to each activity,
Ucgud 1p ucqud Maier GungEsl, Bp GarGaacuc Oster GPGeeord
Aatcin® sflurcs Sen asus CaiiQs@ :
ucqué 1 + ucag ude
ya) ad liumray emer syeray 1. gG Gesu Dapasds ohwo
. ewe sires gsn—}
"by @uAgid eumixtnjan. ainon
Bea 2. fein omer ery
©) Cpe caps are sony 3. GG Geud Papayparer syradl
array 3o70y
A) afiflon aobs ore gona, 4. @pdlu anes sre
eBiip0t:
a b ec da
Neo 4
‘
Be aes
c) 33 i. i. 2
D4 9 2
x : [Turn overASEN 74
Match List I with List If correctly and select your answer using the codes given
below
List 1
a) Expected ume 1
b) Most likely time 2.
©) Optimistic time 3
4) Pessimistic time 4.
Codes : :
a be @
a 3 1 4 2
B) 1
©
*
e
Oss 1 2
D 4 3 2 1
List °
Estimated time an activity would
take
Longest time
Average time an activity will take
Shortest possible time.
Bouy sexrée,
185. QgdtO sands Aphaain semddler Apiy amawrgd
A) Guréean ss some B)
c) LPP D)
Assignment problem is a special case of
A) Transportation problem 8)
cl LPP DI