Skip to content
EndsemNov 20242019 patternBE Mech

Operation Research SPPU Endsem Question Paper Nov 2024

All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.

Subject code
402045 D
Pattern
2019 pattern
Exam
Endsem
Session
Nov 2024
Max. marks
70
Time
2½ Hours
Semester
VII
Paper code
[6354]-623

Printed for: B.E. (MECHANICAL)

Instructions to the candidates

  1. Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
  2. Answers in one answer books.
  3. Figures to the right indicate full marks.
  4. Assume suitable data if necessary.

Questions

  1. Q1

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [10]
    2. b)

      Explain in brief i) Objective function ii) Constraint surface iii) Feasible and infeasible points iv) Optimum solution 2

      Also asked:May 2025 ·May 2024 ·May 2023 ·Nov 2022

      [7]
  2. Q2

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [10]
    2. b)

      Explain in brief i) Limitations of graphical method ii) Conversion of Primal to Dual in LPP problem [4]

      Also asked:Nov 2022

      [3]
  3. Q3

    1. a)

      Discuss in brief the methodology used in Hungarian method to solve the any assignment problems for getting optimum solution.

      [8]
    2. b)

      This part has equations that don’t show as text. Open the PDF to read it.

      [10]
  4. Q4

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [12]
    2. b)

      Differentiate between assignment and transportation problem. 3

      Also asked:Nov 2025 ·May 2024 ·Nov 2023 ·May 2023 ·Nov 2022

      [6]
  5. Q5

    1. a)

      A small project involves 7 activities and their times estimates are listed in the following table. Activities are identified by their beginning i) and ending ii) node numbers. Activities Estimated Duration (Weeks) (i-j) Optimistic Most likely Pessimistic 1-2 1 1 7 1-3 1 4 7 1-4 2 2 8 2-5 1 1 1 3-5 2 5 14 4-6 2 5 8 5-6 3 6 15 i) Draw the network diagram of the activities in the projects. ii) Find expected duration and variance for each activity. What is the expected project length? iii) Calculate the variance and standard deviation of the project length. What is the probability that the project will be completed: 1) At least 4 weeks earlier than expected time. 2) No more than 4 weeks later than expected time. Given Z (0-Z) 1.33 Probability 0.4082

      Also asked:Nov 2022

      [12]
    2. b)

      Explain looping and Dangling errors in the network. 4

      Also asked:Nov 2022

      [6]
  6. Q6

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [12]
    2. b)

      Differentiate between CPM and PERT.

      [6]
  7. Q7

    1. a)

      A dentist scheduled all his patients for 30 minute appointments. Some of the patients take more or less than 30 minutes depending on the type of dental work to be done. The following summary shows the various categories of work, their probability and time actually needed to complete the work: Category of service Time required in Minute Probability Filling 45 0.40 Crown 60 0.15 Cleaning 15 0.15 Extraction 45 0.10 Check up 15 0.20 Simulate the dentist ’ s clinic for four hours and determine the average waiting time for the patients as well as the idleness of the doctor. Assume that all the patients show up at the clinic at exactly their scheduled arrival time starting at 8:00 a.m. Use the following sequence of random numbers to simulate the above problem. Random Numbers: 40. 82. 11,34,25,66, l7,79.

      Also asked:Nov 2025 ·Nov 2023 ·Nov 2022

      [12]
    2. b)

      Write short note on Monto Carlo Simulation. 5

      Also asked:May 2024 ·May 2023 ·Nov 2022

      [5]
  8. Q8

    1. a)

      A salesman located in a city A decided to travel to city B. He knew the distances of alternative routes from city A to city B. He then drew a highway network map as shown in following figure. The city of origin A, is city 1. The destination city B is city 10. Other cities through which the salesman will have to pass through are numbered 2 to 9. The arrow representing routes between cities and distances in kilometres are located on each route. The salesman problem is to find the shortest route that covers all the selected cities from A to B. The time for each activity is given in the table. (Solve by using Dynamic programming). Activity Duration Activity Duration 1-2 4 4-5 6 1-3 6 4-6 10 1-4 3 4-7 5 2-5 7 5-8 4 2-6 10 5-9 8 2-7 5 6-8 3 3-5 3 6-9 7 3-6 8 7-8 8 3-7 4 7-9 4 8-10 7 9-10 9

      [12]
    2. b)

      Explain in brief various steps involved in the simulation. … … …

      Also asked:Nov 2025 ·May 2025 ·Nov 2023 ·May 2023 ·Nov 2022

      [5]