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

Get the Nursing Question Bank Android App

Access 10+ years of Question Papers with answers, notes for B.Sc Nursing on the go!

Install From Play Store

Download JNTUA MCA 2018 July Reg-Supply 2nd Sem 17F00203 Operations Research Question Paper

Download JNTU Anantapur (JNTU Anantapur) Master of Computer Applications (MCA) 2018 June-July Regular Supply 2nd Sem 17F00203 Operations Research Previous 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

MCA II Semester Regular Examinations June/July 2018

OPERATIONS RESEARCH

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

(For students admitted in 2017 only)

Time: 3 hours Max. Marks: 60

Answer all the questions

  1. Discuss importance of operations research in decision making process.

    OR

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

    State different types of modes used in (OR) operations research. Explain briefly general methods for solving OR models.

  2. Explain the following terms in PERT / CPM.

    1. Earliest time.
    2. Latest time.
    3. --- Content provided by‌ FirstRanker.com ---

    4. Event stack.

    OR

    Describe various network models.

  3. How do maximization & minimization problem differ when applying simplex method.

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

    OR

    Explain how Gomory’s cutting plane algorithm works.

  4. Give a note on constraint programming.

    OR

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

    Give a note on applications of metaheuristics to integer linear programs.

  5. A sales man has to visit 5 cities A, B, C, D & E! The distance (hundred km) between 5 cities are:

    A B C D E
    A - 17 16 18 14
    B 17 - 18 15 16
    C 16 18 - 19 17
    D 18 15 19 - 18
    E 14 16 17 18 -

    If the sales man starts from city A and has to come back to city A, which route should he select so as to reduce his distance?

    OR

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

    What is dynamic recursive relation? Describe the general process of backward recursion.



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

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