IPOH GURUKAMPUS INSTITUT PPPENDIDIIKAN JUN2011 Ambilan PPGMATEMATIK KEPUTUSAN MTE 3104 MATEMATII(

LRTIHR N

W.

B AH R c^ rAN A C oB s K rtF) 4! ' logic. Dummy activities usedin activity to are network forcecorrect activity? precedence the of Which thefollowing tables requires useof dummy (A) Activitv Depends on A B D A .C

(B)

Activitv Depends on c A,B D B

(c)

Activitv Depends on
D A

B,C

(D)

Activity Depends on

E F

A.B D C,E

9) /
ii

Which of^the one following statements nottrueabout concept critical is the of path analysis?
:

.
'

(A) (B)

Thestarting point critical of pathanalysisto regroup theactivities. is all path Critical is a sequence activities which of for there noscheduling is flexibitity.

(C) Each.activity network at le-ast path critical has one of activities leading from starting the vertex thefinalvertex, Utn ir.6iteO critical to This tfre path. (D) Critical analysis a technique enables to plan monitor path is that us and complex projects, thattheycanapproached caried as so and out efficiently possibfe. as I i

7 Figure are activities critical? Which (A) A, D,G (c) B, E, H,G

(B) c, F,I Guesbio^ tr-""rd 5 rc-fe. -1o -{hr'Stt"

(D) B, D,G,H
.l

as as want Muthu hisfamily to pack fewsuitcases fromIndia, and Ona triphome parceled They have of must a possible. suitcase have mass lessthan22kg. Each bundles below: as eleven to they upthethings want takeinto Bundle A (kg) Mass B B 12
C D E F G HI J K 14666 6 1 4 8 4 4

t) .
7

to algorithm the is if are suitcasgs needed Muthu using flrst-fit Howmany pack?
(A) 4

{i

(c) 6 CI ) 1 1

5 ) :

suitcases needed Muthu using full-bin are Howmany if is the algorithm to paek?

(A) 4

(C)6

(ts) 5
6 )

cD) A

float the Determine independent forthisactivity'

Head

10

15

19

FigureI

(A) (B)

1.days 2 days

(C) (D)

3 days 4 days

q)

in list Usequick atgorithm arrange following of numbers ascending sort to the order.

4 ,5 ,3 ,7 ,2 What theresult theendof thefirstpass? is at

(A )53472
/rt\ (H )2 364 5 7 a

(c) 3245 tD) 4325

7 7

8)

Interchange is used sortthefolfowing ofnumbers ascending sort to list in order.

7 5
z

10 1

passis The result the Znd for

(A) (B)

1 1

2
5

4t10
4

3 3

(c)
(D)

10 7

615

10 7

f f it

l7[ 61 1 0

BnnRar Asr B (sTRuKroe)

1)

in involved a small thatare in network Figure11 showsactivities The activity time The project. activity is in minutes' \

Etr

-V
I t

,'
--T-

f'{"1
----- 1"ru lao
ll
l- .. rl

higcr-re- ll (a) for predecessors each to the complete tablebelow showtheirnmedia{e activitY. lmmediate Duration Activity tminutes) predecessors A

B
C

e
F

G H
I

5
(b) activities' and duration listthecritical the Give project

C5 rna.rtce)

rt+

C5 roar ks)

2)

limitof has. of each which a weight into are boxes to bepacked crates Eleven 40k9,threeof of of boxes weight50kg,three weight Therearethree 100kg. 20kg' 30kgandtwoofweight weight \ of the and algorithm state number crates decreasing the Apply first-fit used. ( 6 cnovt<s) showthatthere a solution is using crates. fewer

(a)

(b) ,l\. .r, 'I '

=). ru BRHRar r+ 4 Ce,-oe

of a between group the shows roadconnections Thenetworfin Diagrarn'1 that in the represent times minutes a taxi on The villages. numbers thearcs the arcs. network by represdnted those the along roads takesto travel driver issetupreadyforanapplicationofDijkstra'sa|gorithm.

't 4 morks )

Diagram1

to for route thetaxidriver take to Applyiiit rtr"'r algorithm findtheguickest all W' Show your in in his between home uiirtg"H andhii workstation village to labels permanent to the *trking clearly, inOitite orderin which assign thenodes. "nJ these route find how briefly youwould his quickest under Explain circumstances: on H, to is driver about leave he hears theradiothatan accident As the taxi fo alltraffic of a F in occurs the centre-oiiittageis causing detay 1Aminufes that through village (20marks)