- @ : = Ee Agata, it gay ‘pyasy Assiut University | First Year sion research Faculty of Commerce Final Exam I" Ge Answer the following questions: (A) Question 1: (4-10) Consider the following project: Acivities | Path on Oridnary % a d A 12 2 0 B 13 _700 c 4 700 D 15 101 1000 E 35 00 1700 FE 346 1000 1000 G 1000 1000 H y | | 1000 2000 1 1000 1600 ‘ccording r time ES of Event 3 is equal: d) None of the above hed time LF of Event 6 is equal: 92 (GNone of the) ing to PERT network using ordinary time is: c) 16 weeks 4) None of these is: 10 weeks d) None of these a) 13 weeks c) 3 weeks d) None of these (6) Total Normal Cost Is: BS 7000) b) $8000 ¢) $7600 d) None of these (1) The A time of activity E Is: 6 iaN a) 1 week. awed fiver] a) None at ese (8) Acost/ A time of activity Tis: a) $1200 by $400 S100 Gj None or these (9) Time to finish the project with cost wot exceeds $9000 [s: a) 10 weeks pyTiwesks] «peeks 4) None of these (10) The Cost to finish the project within 12 weeks a) $8000 )S 9600. 6) $ Bsv0 QNone of these] Question : ions, sizes of supply (11-15) The following table represents Origins, destinations, Anddemand, and the cost of transpotation § per unit frem every Origin to every Destination: Destination z Origins Z = = Supply (aaa 120) 150 40 400 7" in x0 Ey 600 AN $0. 20 {00 200 Demand 200) too | 300 | (11) According to Lenst Cost Method (LCM) the cell AiBs occupied by: b)o 100 a) None of there (12) According to Least Cost Method (LCN1) the cell AiBz occupied by: ao ‘by 200 ©) 600 PNone of hese} (13) According to Least Cost Method (LCM) the cell A:B) occupied by: 9) 200 per 100 ) None of these (14) According to Least Cost Method (LCM) the celi AB; oceupled by: 3) 200 bo 9600 (15) According to Least Cost Method (LCM) the total cost ls: a) $8000, b)$.87000 ase 4) None of these @B (16) Maximuae-Misinsm value of player Ais ao = © wal be (16-20) The following is a game between player A a A B fn G o =. eel i © 2 3 Bl? a é <= eC (7) Minimum Mexioum vaine of play 7 a & 2) b)3 of these Si (48) This Game is called: coe rosy a) None . . ay None of these Dv): d) None of these met) be AB frome left to right) ‘be CD from left to right) to be EF from left to right)(Let the intersection polit of CD and BF ts L) (Let 0 is the origin) 21The feauible a a) (Down AB) —_b) (Right AB) {rain ai) 22-The fenstble area according tothe constraint (2) Ist ice) GcieD) 4) None of the above 28-The feasible aren aesoring to the courant 3) 6 aes 2) (Down AB) b)(Right AB). fCORER)| ee 24The fens nrea according to the constraint (Di dsiaetind ‘) (OFF) B)(OCD) i rama ap ABD) a Neneh above 25-The feasible ares according to the constraint (2) 153 a) (OFF) by @ED)) COB) 26:The Feasible area according to the constraint (3) it according to the consteaiat (I) is: a) None of the above ) None af the above (a) (i quartet up EF) ‘b) (OCD) ©) (GAB) d) None of the ‘are 27-the easibie area uccording to all constants ix 3) (CME) 4) (OCLD) fee] ) None af the above in * + ary by (10,2), 64) d) None of the above 29-The polat Nis a) (2,1) by, 6) p (4.8, 44) i) None of the above 30-The point Lb: a) G2 Ha Pe. BY 4) None of the above ‘Ji-The Optimal Solution is: 9 @7 3 Wen} 44) None of the above 32-1f constraint (1) fs changed to he 2x +y ¢ 14 thea, the feasible nrea according to the new constralat (1) fs: (2 Ginter AB) — by qughr AB) e) (Up AB) 6) None of the above 33-The feasible area according to the new constraint (1) Ia: ) (oCMa oc) 4) None of the above 34-The new feasible area according fo (he all constraints is; a) (OCMB) 9) (XML) 4) None of the above 35-The New Optimal Solution is:by above [561f all the theee constraints changed to be'< the feasible are 9) (OCMD) ©) (ML {J7:1f the Objective Function changed to be: MI 2) (Profit) -48-Atased on the question (37) fhe new Optimal Solut s) G7) 08) f 39-Based on question (37) if all constraints cha} 1») (OCMB) ay None of these ojzare a) None of these ex A (raw) equal a )2 DE) ot 4) None of these a cding to Mathematical olution the optimal strategy for player B(COULMN) esual part ot 4d) Nome of these = 92 3 ot : eeQuestion 2: 54 ps seek” Cal {4 20 35 -The folowing is a game between player A. andiplayer B: (1) Maximum Minimum value of player 4 ist aye B10 98 d) None of these (Q) Minium Maxim value of player Bis: ays 3 OL 4) None of these (3) This Game is called: 3) Zero Gane ty based strates © ol strates 4) None of these (4) According 10 ‘Méathematical safution te optimal sixategy fos player A (row) equal \ a2 ay 187 d) None of these ( According to athernatleal eolutton the optimal strategy for player B (COULMN) equal az bys ea d) None of these iF PAL= the probability that player A selects strategy a1=0.3 PA2= the probability that player A selects strategy a2 =0.3 PA3 = the probability ‘that player A selects strate a3 =0.4 sax: Eotat } €6(A2),£6(A2) (The. otal gr’ A (129) = oe Bs. 0) 167 ad) None of there, Crt das onnet worle Minn fil a {D) None of these. {D) None of these. {D) None of these. (D) None of these. (C) ome week. (D) None of these. (C)4 weeks, (D) None of these. (C)4.weeks. (D) None of these. {7 weeks. (D) None of these. (C)BEG. —_(D) None of these. (CLoweek. —(D} None of these. (A) 4 weeks. 27) LF of Event 21s equal: {A} 6 weeks. iw {B) 4 weeks. {C) 5 week. — [D) None of these. a 015Fat navi ee & 28) ES of Bvent 3 ls equal: ' (A) 6 weeks. (BLS weeks. {c) 12 week. 29) LF of Event 4s equal: (A) 6 weeks. (B) 4 weeks. ig so wee 30) ES of Event 8 is oqualt (a) 16 weeks. (B) 12 weeks, (©) 10-weelt 31) LF of Event 6 is equal: TA)17 weeks. {B) 10 weeks. (0) 23 week 3a) ES of Event 7 is equal: Ua i7wecks, tegen, (CLE week 3a) LF of Event 7 ia equal: (A) 17 weeks. (B) 32 weeks. 34) Time to finish the project is: - (Q.23.week. (D) None of these. (D) None of these- (c)32 week. _() None of these. {D) None of these, (D) None of these. (D) None of these. [D) None of these. (A) 17 weeks. {B) 23 weeks. 1-10 The following fa details of A projects ~ + ime (week) Activities Path ae © rE % i 12 5 io a a x 1 aa S a4 a a Bess SSS cepa i 1 =z 3a o a o ¥ 7 73 a Ti sere of ACN Cia: i A) 2 weeks, BL9 weeks. G) 8 weeks. Q- TE of activity 0 is _ ALOne weeks. By 4 weeks. 0) 0 weeks. 3- Crticial Path is: + A) ABEF. _Byacr, Gy AD. 4-B8of eteit’ equal: A} G-week, BLT weeks. C) 4 weeks. 8- LF of Event 3 is equal: ALT weeks. B) 6-weeks, OS weeks. 6- LF of Event 2 is equal: A) 2 weelks, B) 4 weeks. C) One week. 7- Time to finish the project te: Al 12 weeles, By 10 weeks. C)8 weeks Ahi HOA) rerercrercemmerereewmmen fo mereemmmeermeearenrererers HOSKIN S6) 7 \ : \Crash the time of finishing the pro} crashing on the cost: PERT network with normal aye 4 i ‘ 2 PERT 2 1 i s Tetivity 1 z 6 ; a * u eT 2 : 3 ‘9000 time ' x 1-2 6 4 B 13 4 c a4 a D 3-5 a E 4-5 ii effect of Ty = 160) + exitical - 2 ths: ACE =4424 4% 1001 critical ep-34+6"9 Be : bobs aaah Hiwatt 7] Boont |o time 14000 a T 3000 | 3 3000 t Ages ee 3000 |} 72000 ———— notes 20 i 'Let Reet een — ———— 4 es es a a ee] oT Too [| 383 WP sar : 2 ‘The following tadie shows the crashing and its elfect on cost: BO 42 3 alcoho Se os SF Se Fe {1°3000 © 37000) = 340000 = 544000 crashing activity D by a week does not ‘affect project duration because Df Part (Game theory) ; sat 3 ee Prayer A es ae 5 30 = \ 3 tse the above given information to answer questions: a (D) None Shen Strategy): (a) Pure. (B) Mixed, —_ (0) Neither A Nor B. 99) If player A plays by bin first strategy and QaAwins. B)Bwind. (GAccual B. {D) None of these. 40) If player A plays by his sacend strategy and player B plays bis player B plays his tira second strategy: ses (jAwin 5. (8) Buin 3. (Glacqual 8. {D) None of these, 41) Maximem Minimum value o} Als: te @)3. @ (D} None of these. 42) Minimum Maximum value of player B is: (ys. [e}s- (c)-2. (D) None of these. 43) Player A will play by [....... Strategy): $ (A) 1x alltime. (B) “alltime. -{(C] 1 part time. (D) Ne 44) Positive numbers of payoff o means: ee win, (B)Bwin. —(C) Aequal B. DIN a Negative numbers of payoff matrix means: Sa win. fas win, (C) Aequal B. {D) None of these. nancy y te as WodtuAt aTSS. Foornewisnn s rere (SHAN 46) Player A will play by his first steatogy: {ay 0.57. 03. ost, p) None af these. 47) The result of the Game In player A point (AL2.5. (B)2. (15. 6-11) Consider the following 2x3 given information to answer ques ‘ 4, Player A 5 Player (0) None of these. 8) : ws (D) None of these. 9) : 4 Le {O) None of these- ‘of view are: {D) None of these- M il Seen lof player N ist A, 2. 1g. This Game called: Aj Zero Game- 0. Cah co. g) Maal strategies. ©) Neither A Nor B. ‘ 14 In this Game player Mens Guana aL —_—a atin t —————[01 RTS eer A) Lose. BLWin. EP Player M plays by: i A) pec et A B) One strategy all T. oc One strategy part T. 16- The result of the Game in the joint of view player M: A) 1/4. B)1 2, G) More than one Questions 1: The following {s the. ne matrix of game between player Masao t) 9 12 Mis ufis fo qos 210. 14 é abecliae 1- The Max. Min fdr player is: a4. 8. e12 D-15. 2. The Min. Max for player N ist A B-8, G12. D- 18. 3- The reault of the game is: ‘A-M will gain 12. ¢, B-Nwill gain 12, CM will lose 12. , D-Both M and N will win. 4-The payoff matrix represents: - A- Negative numbers win for M. Positive numbers win for M. C- Positive numbers win for N. & Positive numbers win for both M and N. 5-The best strategy for N is: rs A- The first strategy. (the second strategy. + D-The fourth strategy. C- The third strategy. Questions 2: The following is the payoff matrix of game between player Land player : ee de 250 a4. Bea. , eo ne 2- The Min, Max for player 8 a BB C0, D2 3. The game is: wyx ae ye Activities Expentesl time ie ont) A B c BD E Fr G H 4; eee eke (enh t) CHG! = ACH +4464 eLae \2