FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download JNTUA MCA 2014 Feb 1st Sem 9F00205 Operations Research Question Paper

Download JNTUA (JNTU Anantapur) MCA (Master of Computer Applications) 2014 Feb Regular-Supplementary 1st Sem 9F00205 Operations Research Question Paper

This post was last modified on 28 July 2020

JNTUA MCA 2nd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)


FirstRanker.com
Firstranker's choice
FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

Code: 9F00205

MCA II Semester Supplementary Examinations February 2014
OPERATIONS RESEARCH
(For 2009, 2010, 2011 & 2012 admitted batches only)

Time: 3 hours Max. Marks: 60

--- Content provided by‍ FirstRanker.com ---

Answer any FIVE questions

All questions carry equal marks

  1. Explain briefly the applications of operation research.
  2. Solve graphically the following LPP
    Maximize z = 3x1 + 2x2

    --- Content provided by‌ FirstRanker.com ---

    Subject to the constraints —2x1 + x2 = 1,
    x1 = 2
    x1 + x2 = 3
    x1,x2 = 0
  3. Use Big M method to maximize z = 2x1 + x2 + 3x3 subject to the constraints x1 + x2 + 2x3 = 5, 2x1 + 3x2 + 4x3 = 12; x1,x2,x3 = 0.
  4. --- Content provided by FirstRanker.com ---

  5. Obtain the dual problem of the primal problem:
    Minimize z = x1 — 3x2 — 2x3 subject to the constraints 3x1 — x2 + 2x3 = 7, 2x1 — 4x2 = 12, —4x1 + 3x2 + 8x3 = 10; x1, x2 = 0 and x3 is unrestricted.
  6. Use dual simplex method to solve the LPP.
    Minimize z = 2x1 + 3x2 subject to the constraints 2x1 —x2 —x3 =3, x1 —x2 +x3 = 2;
    x1,x2,x3 = 0.
  7. --- Content provided by‍ FirstRanker.com ---

  8. What is a balanced transportation problem? What are its applications?
  9. Solve the following travelling salesman-problem so as to minimize the cost per cycle
    City 1 2 3 4 5
    1 - 10 25 25 10
    2 1 - 10 15 2
    3 8 9 - 20 10
    4 14 1 10 - 15
    5 10 8 25 27 -
  10. A company has 6 jobs on hand. Each of these must be processed through two departments J1 and J2. The time required for the jobs on each department in hours is given below.
    A B C D E F
    J1 1 4 6 3 5 2
    J2 3 6 8 8 1 5
    Draw a sequence table scheduling the six jobs on the two departments.
  11. --- Content provided by‍ FirstRanker.com ---

  12. A machine shop has four machines A, B, C, D. Two jobs must be processed through each of these machines. The time (in hours) taken on each of the machines and the necessary sequence of jobs through the shop are given below.
    A B C D
    Sequence Job 1 2 4 5 1
    Sequence Job 2 6 4 2 3
    Use graphic method to obtain the total minimum elapsed time.

FirstRanker.com

Page 1 of 2

FirstRanker.com

--- Content provided by‍ FirstRanker.com ---

Firstranker's choice
FirstRanker.com

Code: 9F00205

  1. A truck with first cost of Rs.80,000 has the depreciation and service pattern shown below;
    Year 1 2 3 4 5 6
    Depreciation during year 28000 20000 14000 5000 4000 4000
    Annual service cost 18000 21000 25000 29000 34000 40000
    Assume no interest charges are necessary for the evaluation. How many years should the truck be kept in service before replacement?
  2. --- Content provided by​ FirstRanker.com ---

  3. Let the value of money be assumed to be 10% per year and suppose that machine A is replaced after every 3 years where as machine B is replaced after every six years. The yearly costs of both the machines are given below.
    Year 1 2 3 4 5 6
    Machine A 1000 200 400 1000 200 400
    Machine B 1700 100 200 300 400 500
    Determine which machine should be purchased.
  4. Use dynamic programming to find the value of maximum z = y1 - y2 - y3 subject to the constraints y1 + y2 + y3 = 5; y1,y2,y3 = 0.
  5. What is dynamic programming? Explain the advantages and disadvantages of dynamic programming.
  6. Describe a two-person zero-sum game.
  7. --- Content provided by FirstRanker.com ---

  8. Solve the following game after reducing it to 2 x 2 ‘game.
    Player B
    Player A (
    17 2
    6 2 7
    5 1 6
    )
  9. Enumerate the various types of inventory models.
  10. The production department of a company requires 3,600 kg of raw material for manufacturing a particular item per year. It has been estimated that the cost of placing an order is Rs.36 and the cost of carrying inventory is 25 percent of the investment in the inventories. The price is Rs.10 per kg. Determine an ordering policy for raw material with the help of purchase manager.

FirstRanker.com

--- Content provided by‍ FirstRanker.com ---

Page 2 of 2



This download link is referred from the post: JNTUA MCA 2nd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)

--- Content provided by‍ FirstRanker.com ---