Operations ResearchMCQ प्रश्नोत्तर
Operations Research - Set 1
यस पेजमा प्रश्न 21–30 (कुल 50 मध्ये)। विकल्पमा थिचेर उत्तर दिनुहोस् — सही/गलत तुरुन्तै देखिन्छ।
- कुल प्रश्न50
- यो पेजमा10 (21–30)
- पृष्ठ3 / 5
- परीक्षा समय30 मिनेट
- जाँचतुरुन्तै
21. While calculating equilibrium probabilities for a Markov process, it is assumed that?
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: B. Transition probabilities do not change
22. In the long run, the state probabilities become 0 & 1.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: C. In all cases
23. If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: A. n
24. State transition probabilities in the Markov chain should.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: A. Sum to 1
25. In Markov analysis, state probabilities must.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: A. Sum to one
26. In a matrix of transition probability, the element aij where i=j is a.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: C. Retention
27. In a matrix of transition probability, the probability values should add up to one in each.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: A. Row
28. Probabilities of occurrence of any state are.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: D. All of these
29. Service mechanism in a queuing system is characterized by.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: A. Server’s behavior
30. The cost of providing service in a queuing system decreases with.
उत्तर हेर्नुहोस् (Show answer)
सही उत्तर: D. None of these
पृष्ठ 3 / 5 · प्रश्न 21–30 (कुल 50)
यही प्रश्नहरू टाइमरसहित क्विजको रूपमा दिनुहोस्30 मिनेट · नतिजा, Rank र विश्लेषणसहित
⏱ टाइमरसहित क्विज दिनुहोस् →
