Mechanical Engineering Exam  >  Mechanical Engineering Tests  >  Past Year Questions: Queuing Theory And Transportation - Mechanical Engineering MCQ

Past Year Questions: Queuing Theory And Transportation - Mechanical Engineering MCQ


Test Description

15 Questions MCQ Test - Past Year Questions: Queuing Theory And Transportation

Past Year Questions: Queuing Theory And Transportation for Mechanical Engineering 2024 is part of Mechanical Engineering preparation. The Past Year Questions: Queuing Theory And Transportation questions and answers have been prepared according to the Mechanical Engineering exam syllabus.The Past Year Questions: Queuing Theory And Transportation MCQs are made for Mechanical Engineering 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Past Year Questions: Queuing Theory And Transportation below.
Solutions of Past Year Questions: Queuing Theory And Transportation questions in English are available as part of our course for Mechanical Engineering & Past Year Questions: Queuing Theory And Transportation solutions in Hindi for Mechanical Engineering course. Download more important topics, notes, lectures and mock test series for Mechanical Engineering Exam by signing up for free. Attempt Past Year Questions: Queuing Theory And Transportation | 15 questions in 15 minutes | Mock test for Mechanical Engineering preparation | Free important questions MCQ to study for Mechanical Engineering Exam | Download free PDF with solutions
Past Year Questions: Queuing Theory And Transportation - Question 1

The cost of providing service in a queuing system increases with

[1997]

Past Year Questions: Queuing Theory And Transportation - Question 2

At a production machine, parts arrive according to a Poisson process at the rate of 0.35 parts per minute. Processing time for parts have exponential distribution with mean of 2 minutes. What is the probability that a random part arrival finds that there are already 8 parts in the system (in machine + in queue)?

[1999]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 2

1 Crore+ students have signed up on EduRev. Have you? Download the App
Past Year Questions: Queuing Theory And Transportation - Question 3

In a single server infinite population queuing model. Arrivals follow a Poisson distribution with mean = 4 per hour. The service times are exponential with mean service time equal to 12 minutes. The expected length of the queue will be

[2000]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 3

Past Year Questions: Queuing Theory And Transportation - Question 4

A maintenance service facility has Poisson arrival rates, negative exponential service time and operates on a 'first come first served' queue discipline. Break-downs occur on an average of 3 per day with a range of zero to eight. The maintenance crew can service an average of 6 machines per day with a range of zero to seven.The mean waiting time for an item to be serviced would be

[2004]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 4

Past Year Questions: Queuing Theory And Transportation - Question 5

Consider a single server queuing model with Poisson arrivals () and exponential service (). The number in the system is restricted to a maximum of 10. The probability that a person who comes in leaves without joining the queue is

[2005]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 5

When r = 1,

Past Year Questions: Queuing Theory And Transportation - Question 6

The number of customers arriving at a railway reservation counter is Poisson distributed with an arrival rate of eight customers per hour. The reservation clerk at this counter takes six minutes per customer on an average with an exponentially distributed service time. The average number of the customers in the queue will be

 [2006]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 6

Average number of customer in queue

Past Year Questions: Queuing Theory And Transportation - Question 7

 In an M/M/1 queuing system, the number of arrivals in an interval of length T is a Poisson random variable i.e. the probability of there being n arrivals in an interval of length T is The probability density function f(t)of the inter- arrival time is given by

[2008]

Past Year Questions: Queuing Theory And Transportation - Question 8

Little's law is a relationship between

[2010]

Past Year Questions: Queuing Theory And Transportation - Question 9

Cars arrive at a service station according to Poisson's distribution with a mean rate of 5 per hour. The service time per car is exponential with a mean of 10 minutes. At steady state, the average waiting time in the queue is

[2011]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 9

Past Year Questions: Queuing Theory And Transportation - Question 10

Customers arrive at a ticket counter at a rate of 50 per hr and tickets are issued in the order of their arrival. The average time taken for issuing a ticket is 1 min. Assuming that customer arrivals form a Poisson process and service times are exponentially distributed, the average waiting time in queue in min is

[2013]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 10

Past Year Questions: Queuing Theory And Transportation - Question 11

For a single server with Poisson arrival and exponential service time, the arrival rate is 12 per hour. Which one of the following service rates will provide a steady state finite queue length?

[2017]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 11

For steady state , as customer s/hour , we need to select option (d)

Past Year Questions: Queuing Theory And Transportation - Question 12

The supply at three sources is 50, 40 and 60 units respectively while the demand at the four destinations is 20, 30,10 and 50 units. In solving this transportation problem.

[2002]

Past Year Questions: Queuing Theory And Transportation - Question 13

If there are m sources and n destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is

[2014]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 13

It is evident from the above diagram , that m + n equation s (1) an d (2) constitute m +n – 1 independent equations in mn unknowns.

Past Year Questions: Queuing Theory And Transportation - Question 14

The total number of decision variables in the objective function of an assignment problem of size n × n{n jobs and n machines) is

[2014]

Detailed Solution for Past Year Questions: Queuing Theory And Transportation - Question 14

A  n X n assignment probl em , if it is solved as a LPP it will have n2 variables.

Past Year Questions: Queuing Theory And Transportation - Question 15

A product made in two factories, P and Q, is transported to two destinations, Rand S. The per unit costs of transportation (in Rupees) from factories to destinations are as per the following matrix:Factory P produces 7 units and factory Q produces 9 units of the product. Each destination requires 8 units. If the north-west corner method provides the total transportation cost X(in Rupees) and the optimized (the minimum) total transportation cost is Y(in Rupees), then(X-Y), in Rupees, is

[2017]

Information about Past Year Questions: Queuing Theory And Transportation Page
In this test you can find the Exam questions for Past Year Questions: Queuing Theory And Transportation solved & explained in the simplest way possible. Besides giving Questions and answers for Past Year Questions: Queuing Theory And Transportation, EduRev gives you an ample number of Online tests for practice

Top Courses for Mechanical Engineering

Download as PDF

Top Courses for Mechanical Engineering