Scribd
Upload
12 views16 pages

Z200091T

The document is a question booklet for the BCA (SEM.-IV) examination on Optimization Techniques, containing 100 questions from which examinees must answer 75. It includes instructions for filling out the OMR answer sheet and various optimization-related questions, such as linear programming, network diagrams, and transportation problems. The exam is scheduled for 2024 and has a maximum score of 75 marks.

Uploaded by

rishirajsri15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
12 views16 pages

Z200091T

The document is a question booklet for the BCA (SEM.-IV) examination on Optimization Techniques, containing 100 questions from which examinees must answer 75. It includes instructions for filling out the OMR answer sheet and various optimization-related questions, such as linear programming, network diagrams, and transportation problems. The exam is scheduled for 2024 and has a maximum score of 75 marks.

Uploaded by

rishirajsri15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
« [Link]. Serial No. [|] LI Question Booklet Number 403195 BCA (SEM.-IV) (NEP) EXAMINATION, 2024 COMPUTER APPLICATION (Optimization Techniques ) [BCA-4004 ] Question Booklet Paper Cod Series (z[2]o[ofo[o]1[r Cc Time: 1: 30 Hours Max. Marks : 75 Instructions to the Examinee : réentat S ferg Pte : 1. Donotopenthe booklet unless youare 1. oe-gfteran aa ca a aa oa ae aOR asked to do so. aa TL S E 2, The booklet contains 100 questions. > seegfiaar 100 newt Bi afer at Examinee is required to answer 75 er ee questions in the OMR Answer-Sheet provided and notin the question booklet Be eB, ser afeer e ah ae et All questions carry equal marks. 3 ofa wart Bi 3. Examine the Booklet and the OMR 3. Seat & aur sift eet @ pf mega | Answer-Sheet very carefully before you Ta OMR arate a aaarigs te proceed. Faulty question booklet due to i dope serge Pree ye arr out missing or duplicate pages/questions or ae a ae we a ats aera | having any other discrepancy should be a ar a fed ar gare A ah a, oA got immediately replaced. ar ea a 4. Four alternative answers are mentioned 4. for each question as -A, B,C & D inthe booklet. The candidate has to choose the correct / answer and mark the same in the OMR Answer-Sheet as per the direction : (Remaining instructions on last page) meg Hots oS a water GR A B,C et DE Sher a oT art Reredt 4 @ adi gee stem Bi suv at omR Sree 4 waPaa get dom % Pet ware ere: (ty Rie arr pe 9) In the context of the assignment 4. — Linearprogrammingis__. ™ problem, what does the term (A) _ constraint optimization model apaigricih B) constraint decision making ‘assignment” refer to? (A) The process of distributing model (©) mathematical programming tasks to resources : model (B) The evaluation of resource (D) Allofthe above yee 5. is the point in time that marks = the beginning or ending of an activity. completion time pea (D) The optimization of resource (By: Nae utilization (©) Activity 2. Optimal solution in LPP is__ (D) Dummy activity (A) whichmaximizesorminimizes 6, — What do we apply in order to iy the objective function determine the optimum solution? (B) _ which maximizes the objective (a) Lpp function (8) vam (©) which minimizes the objective (©) MODIMethod iiacticn (D) None ofthe above (D) which satisfies the non- 7: Amixed strategy can be solved by : (A) algebraicmethod (B) _ matrixmethod (C) graphical method (D) Alloftheabove 8. In a network diagram activity is negativity restrictions 3. In graphical solution the feasible region is : (A) where all the constraints are satisfied simultaneously denoted by : (B) any one constraint is satisfied os oe (C) only the first constraint is (@) arrow satisfied (©) triangle (D) anyone of the above condition (D) none of these 2200091 T-C/1290 (3) [PTO] A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the : (A) Constraints (B) Objective Functions (©) Both (A) and (B) (D) None of the above 10. Which of the following is a type of linear programming problem? (A) Diet Problem (B) Manufacturing Problem (C) Transportation Problem (D) Allofthe above 11. In simplex method the LPP has unbounded solution if the variable in the key column is : (A) maximum (B). minimum (©) _ positive (D) negative 12. Inthe standard form of an LPP if the objective function is of maximization type then the right hand side of the constraints should be : (A) _ positive (B) _ negative (©) _ non-negative (D) zero Z200091T-C/1290 (4) Ifan activity has zero slack, itimplies. that : (A) __ ities on the critical path (B) _ itisa dummy activity (C) the project is progressing well (D) none of the above Float or slack analysis is useful for_ (A) _ Projects behind the schedule only (B) Projects ahead of the schedule only (©) Both(A)and(B) (D) None of the above PERT is a tool for ___and control time. (A) Delaying (B) Planning (C) Both(A)and(B) (D) Noneofthe above Transportation problem is a special case of __. (A) LPP (B) _ assignment problem (©) _ None ofthe above (D) Both(A) and (B) In assignment problem if the number of column is greater than row then : (A) dummy column is added (B) dummy row is added (©) rowwith cost | is added (D) column with cost 1 is added 18. For a minimisation Transportation 23. Problem, the objective is to minimise: (A) Profit (B) Cost (C) Solution (D) None of these 24, 19. Replacement is said to be necessary if: (A) _ failure rate is increasing (B) _ failure cost is increasing (©) _failureprobabilityisinereasing (D) any of these . 20. _______ is an event oriented network diagram, (A) CPM (B) PERT (C) Histogram (D) Ogive 21. Activities that cannot be started until one or more of the other activities are 26 completed, are called (A) Dummy activities (B) Initial activities (C) Successor activities (D) Predecessor activities 22. is activity oriented 77, network diagram. (A) CPM (8) PERT (©) Histogram @) Ogive 7200091 T-C/1290 (s) ALPP model does not contain : (A)__ Decision (B) Constraints (C) Feasible solution (D) Spread Sheet The EST + activity duration (A) _ Earliest Finish Time (B) _ Latest Start Time (C) Latest Finish Time (D) None of these is the latest time by which an activity can be finished without delaying the completion of the project? (A) st @) UT (©) ET @) EST Network models have advantages in terms of project : (A) planning (B) scheduling (©) controlling ) Allofthe above The another term commonly used for activity slack time is : (A) total float (B) free float (C) independent float () Allofthe above PTO] 28. 29. Inanetwork diagram event is denoted by the symbol : (A) arrow (B) circle (©) curve (D) straight line 30. __isused for non-repetitive jobs. 34. (A) Queue (B) Replacement (© CPM (D) PERT 31. Which of the following methods is used to verify the optimality of the current solution of the transportation problem ? (A) Least cost method (B) _ Vogel’s Approximation method (©) Rowminima method (D) Modified Distribution method 32. Thisis not allowed in sequencing of n jobs on two machines : 35. (A) Passing (B) Repeating the job (C)_ Loading (D) One loaded on the machine it should be completed before removing from the machine. Z200091T-C/1290 (6) Critical method is good for : 33. (A) small project only (B) large project only (C) small and large project equally (D) neither small nor large projects The occurrence of degeneracy while solving a transportation problem means that : (A) Total supply equals total demand (B) _ The solution so obtained is not feasible (C) The few allocations become negative (D) None ofthe above To convert assignment problem into maximization problem : (A) Deduct smallest element in the matrix from all other elements (B) Allclements of the matrix are deducted from the highest elements in the matrix (C) Deduct smallest element in any row from all other elements of the row (D) Deductall elements of the row from highest element in that row Ifthere are ‘m’ original variables and ‘n’ introduced variables, then there will be columns in the simplex table : (A) M+n @®) M-n (©) 3+mtn () M+tn-1 36 Operations research is the application of methods to arrive at the optimal solutions to the problems. (A) economical (B) scientific (©) Both(A)and(B) (D) artistic 37 Feasible solution satisfies (A) Only constraints (B) Only non-negative restriction 41. Thesize of the payoffmatrix of agame can be reduced by using the principle of: (A) game inversion (B) rotation reduction (C) dominance (D) game transpose 42. Find Strategy of the player in the given (C) _Both(A)and(B) pay-off matrix. ©) {A} [B]and Optimum solution [piyecAPayerB [BI] BP] Bs 38 Minimize Z = Al ~2sa[ 4ee fees me A Saf coe | (A) -maximize(Z) A3 6 20 8 | (B)_ -maximizet-2) aun (©) maximize(-z) (D) None of the above @) ALBS 39 Operations research was known as an © = ALBI ability to win a war without really going (D) A3,B2 into = 43. Find Solution of, blem (A) _ Battle field a using saddle point (B) Fighting (©) Theopponent (D) Both(A) and (B) 40 Ifthere exists a saddle point fora given problem it, implies that the players are using strategies. (A) Pure (B) Mixed (©) Optimal (D) Pure and Mixed 2200091 T-C/1290 (7) Player-A/Player-B | B1] B2 | B3 | B4 Al 20] 15 [12 [35 AZ 25[ 1418 [10 AR 40{ 2 [10 [5 ‘Ad s{4 tuto (A) 20 () 12 (© 18 @) 16 [PT.0.) 44. 45. 46. 47. 48. The Penalty in VAM represents difference between cost of respective row/column. (A) Twolargest (B) Largest and Smallest (C) Smallest Two (D) None of the above In maximization case of transportation problem, we convert into minimization by subtracting all the elements from : (A) zero (B) one (C)__ highest element (D) _ lowest element Pessimistic time optimistic time of completion of an activity are given as 10 days and 4 days respectively, the variance of the activity will be : (a) 1 (B) 6 © 12 @) 18 ‘An LPP deals with problems having only : (A) _ single objective (B) multiple objective (C)__ twoobjective (D) _ none of these In transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is : 2200091T-C/1290 49. 50. $i. 52. (8) (A) north west comer i (B) lowest cost (C) _ vogel approximation method (D) simplex method Innorth west comer rule if the demand in the column is satisfied one must move to the : (A) left cell in the next column (B) right cell in the next column (C) left cell in the next row (D) right cell in the next row In transportation problem the improved solution of the initial basic feasible solution is : (A) _ basic solution (B) _ optimal solution (C) degenerate solution (D) non-degenerate solution The group replacement policy is suitable for identical low cost items which are likely to_____ (A)__ Fail overa period of time (B) Failsuddenly (©) Failcompletely and suddenly (D) None ofthe above If ui and yj are row and column numbers respectively, then the implied cost is given by: (A) wityj (8B) ui-vj (©) uixvj ) ui/yj 53. Which of the following method cannot 57. be used to solve transportation problem? (A) North-West corner rule (B) Matrixminima method (©) Vogel’s Approximation method (D) Graphical method 54. In method consider the 59 least cost and next to least cost for solving transportation problem. (A) North-west comer (B) Matrix minima (C) Vogel's Approximation (D) RowMinima method 55, Thetuinimam minberaflinecovediig °° all zeros in a reduced cost matrix of orderneanbe___. (A) Atleastn (B) Atmostn © al (D) n+l 60 56. Thetermidle time is used in_. (A) LPP (B) Assignment Problem (C) Sequencing Problem (D) Transportation Problem Z200091T-C/1290 (9) If a primal LP problem has finite solution, then the dual LP problem should have : (A) _ Finite solution (B) _ Infeasible solution (©) Unbounded solution (D) None of these The objective of network analysis is : (A) Minimize total project duration (B) Minimize total project cost (C) Minimize product delays, interruption and conflicts (DP) Allofthe above If the feasible region of a LPP is ‘empty, the solution is : (A) _ Infeasible (B) Unbounded (©) Alternative (D) None of the above Any column or row of simplex table is called a: (A) Vector (B) Keycolumn (©) KeyRaw (D) _ None of these PTO] 61. 63. In replacement analysis the maintenance cost is a function of : (A) time (B) resale value (C) _ initial investment * (D) None of these 64. The shortest possible completion time of an activity in PERT is called___ time. (A) _ pessimistic (B) optimistic (C)__ most likely () expected 6. 65. — The longest possible completion time of an activity in PERT is called __ time. (A) _ pessimistic (B) optimistic (©) most likely (@) expected 2200091 T-C/1290 (10) In simplex method, we add 66. variables in the case of “= (A) Slack Variable (B) Surplus Variable (C) Artificial Variable (D) None of the above Dual of the dual is : (A) Primal (B) Dual 61. (C)_ Altemative (D) None ofthe above If a is the optimistic time, b is the pessimistic time and m is most likely time of an activity, the expected time of the activity, is : (A) atm+b (B) a+2m+b (© at4m+b () at+sm+2b Ifa job is having minimum processing time under both the machines, then the job is placed in : (A) any one position (B) available position (C)__ available first position (D) _ both first and last position In graphical solution of solving LPP to convert inequalities into equations, we: (A) _ use slack variables (B) _ use surplus variables (C) _useartificial variables (D) simply assume them to equations JOB ABI C| DIE! F MACHINE (M1) [2/91 8 [10] 4] 17 MACHINE (M2) | 5] 7{ 12] 3 [9] 1 Using the Johnson rule find the right sequence of the job : (A) AECEBD (B) ABCDEF (©) DBFCEA (D) ADBCEF 70. A gameis said tobe fair if: 14. (A) both upper and lower values of the game are the same and zero (B) upper and lower values of the game are not equal (C) upper value is more than the lower value of the game (D) "None of these 71. What happens when maximin and minimax values of the game are same? (A) no solution exists (B) solution is mixed (©) saddle point exist (D) None of these = 72. Operations research was known as an ability to win a war without really going, into. (A) Battle field (B) Fighting (C)_ The opponent (D) _Both(A)and(B) 76. 73. — Inapure strategy game : (A) any strategy may be selected arbitrarily (B) _ aparticular strategy is selected by each player (©) both players select their optimal strategy (D) None of these 7200091T-C/1290 (il) What is the rule for the earliest start time? (A)__ It compares the activity’s start time to that of a successor activity (B) It compares the activity’s end time to that of a previous activity (©) _ Itspecifies when a project may begin (D) _Itestablishes the start date for a project What is the definition of a critical path? (A) It’s a path that connects the starting and ending nodes (B) It combines all of the paths (©) __ Itis the shortest route (D) _ Itis the most direct route What is the primary objective of job sequencing with two machines? (A) Minimizing the total processing time (B) Maximizing the number ofjobs completed (C) Equalizing the workload on both machines (D) _ Prioritizing high-priority jobs PTO] 77. To formulate a problem for solution by the simplex method, we must add artificial variable to : (A) _ only equality constraints (B) _ only> constraints (C) Both(A)and(B) (D) None of these 78. In Degenerate solution value of objective function . (A) _ increases infinitely (B) basic variables are nonzero (C) decreases infinitely (D) Oneormore basic variables are zero 79. Consider the linear equation 2 x1 +3x2 = 4x3 +5 x4 = 10 How many basic and non-basic variables are defined by this equation? (A) One variable is basic, three variables are non-basic (B) Two variables are basic, two variables are non-basic (C) Three variables are basic, one variable is non-basic (D) All four variables are basic 80. _ Inthe optimal simplex table cj -zj=0 value indicates : (A) unbounded solution () cycling (C)__ altemative solution (D) None of these Z200091T-C/1290 81 82. 83. 84. 85. (12) If all incoming variable column is negative then the solution is : (A) Unbounded solution (B) _ Infeasible solution (C) Feasible Solution (D) None of the options In the simplex method the variable enters the basis if . (A) Zj-Gj 20 8) Z-cj quantity supplied (C) quantity demanded » quantity supplied (D) quantity demanded = quantity supplied 2200091T-C/1290 In graphical method the LPP has 89. unbounded solution if the solution space has : (A) noupper boundary (B) _nolowerboundary (C) no boundary in the first quadrant (D) None of the above (3) In the transportation problem if the current supply of the warehouses exceeds the current demand of the markets then, (A) fictitious introduced (B) fictitious market is introduced (C) decrease the supply of existing warehouse (D) _ thedemand of existing market In transportation problem if total supply > total demand we add: (A) dummy row with cost 0 (B) dummy column with cost 0 (C) dummy row with cost 1 (D) dummy column with cost 1 In least cost method the allocation is done by selecting (A) upper left comer (B) _upperright comer (©) middle cell in the warehouse is transportation table (D) cell with the lowest cost An assignment problem is considered as a particular case of a transportation problem because : (A) the number of rows equals columns (B) all xij=Oorl (©) Both(A)and(B) (D) None of these PTO] 93. 94. 95. 96. 22 Which of the following is a characteristic ofa dual problem : (A) Dual ofa dual is primal (B) If dual has a finite optimal solution, then the primal also has finite optimal solution (C) _ If dual has no feasible solution, then the primal also has no feasible solution (D) Allofthe above When all the players of the game follow their optimal strategies, then the expected pay off of the game is called (A) Gain of the game (B) Loss of the game (C)__ Value of the game (D) None of these Before formulating a formal L P model, it is better to : (A) Verbally identify decision variables (B) Express the objective function in words (©) Express each constraint in words (D) Alloftheabove What is the primary objective of job sequencing with two machines? (A) Minimizing the _ total processing time 100091 T-C/1290 97. 98. 99. 100. a4) (B) Maximizing thenumber of jobs», completed (C) Equalizing the workload on both machines (D) _ Prioritizing high-priority jobs In models, everything is defined and the results are certain. (A) _ Probabilistic (B) Deterministic (C) Both(A)and(B) (D) None of these The key column indicates : (A) outgoing variable (B) _ incoming variable (C) _ independent variable (D) dependent variable’ If a machine becomes old then the failure rate expected will be : (A) constant (B) _ increasing (C) decreasing (D) _wecannot say The two forms of LPP are : (A) standard form and canonical form (B) standard form and general form (C)__ matrix form and canonical form (D) matrix form and standard form ROUGH WORK 2200091 T-C/1290 as) Example: Question : ar ®@e@oo® a2 ®@6®eo0 aa @@®O© 0 5. Each question carries equal marks. Marks will be awarded according to the number of correct answers you have. 6. _All answers are to be given on OMR Answer Sheet only. Answers given anywhere other than the place specified in the answer sheet will not be considered valid. 7. Before writing anything on the OMR Answer Sheet, all the instructions given init should be read carefully. After the completion of the examination, candidates should leave the examination hall only after providing their OMR Answer Sheet to the invigilator. Candidate can carry their Question Booklet. 9. There will be no negative marking. 10. — Rough work, if any, should be done on the blank pages provided for the purpose inthe booklet. 11. Tobring and use of log-book, calculator, pager & cellular phone in examination hall is prohibited. 12, _ Incase of any difference found in English and Hindi version of the question, the English version of the question will be held authentic. Impt. On opening the question booklet, first check that all the pages of the question booklet are printed properly. If there is any discrepancy in the question Booklet, then after showing it to the invigilator, get another question Booklet of the same series. SareeT wet: m1 68 e600 wi2@ © @ © ms @@©O 6. sae oe ois FAM 8) oITS PTA SAT ad, GES ogee os ere RA TA 6. wh Sat Saat Shomfosto TATA (OMR Answer Sheet) o¢ @ PR oT Ft sacs 4 Puffa wr 3 sear oe aed oe Rear ar sae APT AEE rT 7, Sogiosite TATA (OMR Answer Sheet) 1 qe «ft fray & qf oat RA we ad orga aaerigdss We er ori 8. Thar wae S suet There wer Frees @ aneit OMR Answer Sheet S74 HTT & ae Gt ater ser 8 wert at There ST Te we gficat ToT Ba Bi 9. Pte air ae 10. ae Hee ar, aergfrar 9, Ha S fare Req Garett Bor ae & Pear oT eae 11. ates 8 age, Sages, ar aa Begae Be 8 ot ae see oe Fer aia Bi 12, met 8 fed oe oft wareree @ Reta AF @ am a ger a et woraeT & TT am aeeagh: weagierer Gat we wera: sia |e de & fe wages 8 wh ys eit ot we hi at segias F at ot a, at sapriers st free vet freer at grt meTgheet wet St Ti

You might also like