हिंदी

HSC Commerce (Marathi Medium) १२ वीं कक्षा - Maharashtra State Board Important Questions

Advertisements
विषयों
अध्याय
विषयों
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  661 to 680 of 736  next > 

Choose the correct alternative :

The assignment problem is said to be balanced if it is a ______.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Solve the following problem :

Five jobs must pass through a lathe and a surface grinder, in that order. The processing times in hours are shown below. Determine the optimal sequence of the jobs. Also find the idle time of each machine.

Job I II III IV V
Lathe 4 1 5 2 5
Surface grinder 3 2 4 3 6
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

Solve the following problem :

Find the sequence that minimizes the total elapsed time to complete the following jobs. Each job is processed in order AB.

Machines Jobs (Processing times in minutes)
I II III IV V VI VII
Machine A 12 6 5 11 5 7 6
Machine B 7 8 9 4 7 8 3

Determine the sequence for the jobs so as to minimize the processing time. Find the total elapsed time and the idle times for both the machines.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

Choose the correct alternative:

If there are 3 machines A, B and C, conditions for reducing a 3 machine problem to a 2 machine problem with respect to minimum processing time is ______

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

If there are n jobs and m machines, then there will be _______ sequence of doing jobs.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

An unbalanced assignment problems can be balanced by adding dummy rows or columns with ______ cost

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

In sequencing problem the time which required to complete all the jobs i.e. entire task is called ______

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Sequencing Problem
Book A B C D
Printing 5 8 10 7
Data Entry 7 4 3 6

The optimum sequence for the above data is ______

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Finding an Optimal Sequence

State whether the following statement is True or False:

In sequencing problem the processing times are dependent of order of processing the jobs on machine

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Sequencing Problem

Find the assignments of salesman to various district which will yield maximum profit

Salesman District
1 2 3 4
A 16 10 12 11
B 12 13 15 15
C 15 15 11 14
D 13 14 14 15
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

Find the sequence that minimizes total elapsed time to complete the following jobs in the order XY. Find the total elasped time and idle times for each machine.

Jobs A B C D E
Machine X 10 2 18 6 20
Machine Y 4 12 14 16 8
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

For the following assignment problem minimize total man hours:

Subordinates Required hours for task
I II III IV
A 7 25 26 10
B 12 27 3 25
C 37 18 17 14
D 18 25 23 9

Subtract the `square` element of each `square` from every element of that `square`

Subordinates Required hours for task
I II III IV
A 0 18 19 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0

Subtract the smallest element in each column from `square` of that column.

Subordinates Required hours for task
I II III IV
A `square` `square` 19 `square`
B `square` `square` 0 `square`
C `square` `square` 3 `square`
D `square` `square` 14 `square`

The lines covering all zeros is `square` to the order of matrix `square`

The assignment is made as follows:

Subordinates Required hours for task
I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Optimum solution is shown as follows:

A → `square, square` → III, C → `square, square` → IV

Minimum hours required is `square` hours

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

State whether the following statement is true or false:

To convert a maximization-type assignment problem into a minimization problem, the smallest element in the matrix is deducted from all elements of the matrix.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

A job production unit has four jobs P, Q, R, and S which can be manufactured on each of the four machines I, II, III, and IV. The processing cost of each job for each machine is given in the following table:

Job Machines
(Processing cost in ₹)
I II III IV
P 31 25 33 29
Q 25 24 23 21
R 19 21 23 24
S 38 36 34 40

Find the optimal assignment to minimize the total processing cost.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Five jobs are performed first on machine M1 and then on machine M2. Time taken in hours by each job on each machine is given below:

Machines↓\Jobs→ 1 2 3 4 5
M1 6 8 4 5 7
M2 3 7 6 4 16

Determine the optimal sequence of jobs and total elapsed time. Also, find the idle time for two machines.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Finding an Optimal Sequence

Three new machines M1, M2, M3 are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine M2 can not be placed at B. The cost matrix (in hundred rupees) is as follows:

Machines Places
  A B C D
M1 13 10 12 11
M2 15 - 13 20
M3 5 7 10 6

Determine the optimum assignment schedule and find the minimum cost.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

If X has Poisson distribution with parameter m and P(X = 2) = P(X = 3), then find P(X ≥ 2). Use e−3 = 0.0497

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

The expected value of the sum of two numbers obtained when two fair dice are rolled is ______.

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

Choose the correct alternative:

A distance random variable X is said to have the Poisson distribution with parameter m if its p.m.f. is given by P(x) = `("e"^(-"m")"m"^"x")/("x"!)` the condition for m is ______

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

If X follows Poisson distribution such that P(X = 1) = 0.4 and P(X = 2) = 0.2, using the following activity find the value of m.

Solution: X : Follows Poisson distribution

∴ P(X) = `("e"^-"m" "m"^x)/(x!)`, P(X = 1) = 0.4 and P(X = 2) = 0.2

∴ P(X = 1) = `square` P(X = 2).

`("e"^-"m" "m"^x)/(1!) = square ("e"^-"m" "m"^2)/(2!)`,

`"e"^-"m" = square  "e"^-"m" "m"/2`, m ≠ 0

∴ m = `square`

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution
< prev  661 to 680 of 736  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×