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 2016 May Supply 2nd Sem 9F00205 Operations Research Question Paper

Download JNTU Anantapur (JNTU Anantapur) Master of Computer Applications (MCA) 2016 May Supply 2nd Sem 9F00205 Operations Research Previous Question Paper

This post was last modified on 28 July 2020

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


FirstRanker.com

Code: 9F00205

MCA II Semester Regular & Supplementary Examinations May 2016

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

OPERATIONS RESEARCH

(For students admitted in 2010, 2011, 2012, 2013, 2014 & 2015 only)

Time: 3 hours Max. Marks: 60

Answer any FIVE questions

All questions carry equal marks

--- Content provided by​ FirstRanker.com ---

  1. (a) Explain why and how operations research methods have been valuable in aiding executive decisions.
    (b) Two of the major limitations of linear programming are assumption of “Additively” and “Single objective”. Elaborate by giving appropriate examples.
  2. (a) What is the essential difference between simplex method and dual simplex method?
    (b) Use dual simplex method to solve:
    Minimize Z = x1 + x2

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

    subjected to 2x1 + x2 = 2
    -x1 - x2 = 1 and
    x1, x2 = 0
  3. (a) Explain how to resolve degeneracy in a transportation problem.
    (b) The matrix shows the processing time in hours. Solve this assignment problem using Hungarian method.

    --- Content provided by​ FirstRanker.com ---

    1 2 3 4 5
    1 12 20 22 35 18
    2 14 12 26 24 27
    3 23 14 17 19 19
    4 17 15 16 18 15
    5 16 19 21 19 25
  4. Find the sequence that minimizes the total time required in performing the following jobs on three machines in the order ABC. Processing times in hours are given in the following table.
    Job 1 2 3 4 5
    Machine A 8 10 6 7 11
    Machine B 5 6 2 3 4
    Machine C 4 9 8 6 5
    Also determine the idle time for machines A, B and C.
  5. (a) What is replacement? Describe some important replacement situations.
    (b) The cost of a machine is Rs. 6,100 and its scrap value is only Rs.100, from experience the maintenance costs are found to be:

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

    Year 1 2 3 4 5 6 7 8
    Maintenance 100 250 400 600 900 1250 1600 2000
    When should the machine be replaced?
  6. Define the following dynamic programming terms:
    Stage.
    State variable.
    Decision variable.

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

    Optimal return.
  7. Solve the following game.
    Player B
    Player A
  8. (a) Derive an EOQ formula with different rates of demand in different cycles.

    --- Content provided by​ FirstRanker.com ---

    (b) Compare EOQ and the total variable cost for the following items.
    Annual demand = 500 units ; Unit price = Rs 20
    Order cost = Rs 16 ; Storage rate = 2% per annum
    Interest rate = 12% per annum ; Obsolescence rate = 6% per annum

FirstRanker.com

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



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

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