Download App

Maths (commerce) MCQ

Assignment Problem and Sequencing (p-2) · Maharashtra Board STD 12 Commerce / Arts (MSBSHSE - English Medium). 14 questions.

Questions

MCQ

Take a timed test

14 questions · auto-graded multiple-choice test.

MCQ 11 Mark
The assignment problem is said to be unbalanced if
  • A
    Number of rows is greater than the number of columns
  • B
    Number of rows is lesser than number of columns
  • C
    Number of rows is equal to the number of columns
  • ✓
    Both (a) and (b)
Answer
Correct option: D.
Both (a) and (b)
Both (a) and (b)
View full question & answer→
MCQ 21 Mark
Using the Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:
AGENTJOB
ABCD
110121525
214111932
318212329
415202628
  • ✓
    $1- C , 2- B , 3- D , 4- A$
  • B
    $1- B , 2- C , 3- A , 4- D$
  • C
    $1- A , 2- B , 3- C _1 4- D$
  • D
    $1- D , 2- A , 3- B , 4- C$
Answer
Correct option: A.
$1- C , 2- B , 3- D , 4- A$
$1- C , 2- B , 3- D , 4- A$
View full question & answer→
MCQ 31 Mark
To use the Hungarian method, a profit maximization assignments problem requires
  • ✓
    Converting all profit to opportunity losses
  • B
    A dummy person or job
  • C
    Matrix expansion
  • D
    Finding the maximum number of lines to cover all the zeros in the reduced matrix
Answer
Correct option: A.
Converting all profit to opportunity losses
Converting all profits to opportunity losses
View full question & answer→
MCQ 41 Mark
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
  • A
    No passing is allowed
  • B
    Processing times are known
  • C
    Handling times is negligible
  • ✓
    The time of passing depends on the order of machining
Answer
Correct option: D.
The time of passing depends on the order of machining
The time of passing depends on the order of machining
View full question & answer→
MCQ 51 Mark
The Assignment Problem is solved by
  • A
    Simple method
  • ✓
    Hungarian method
  • C
    Vector method
  • D
    Graphical method
Answer
Correct option: B.
Hungarian method
Hungarian method
View full question & answer→
MCQ 61 Mark
If there are n jobs and m machines, then there will be ___________ sequences of doing the jobs.
  • A
    mn
  • B
    $m(n!)$ 
  • C
    $n^m$
  • ✓
    $(n!)^m$
Answer
Correct option: D.
$(n!)^m$
$(n!)^m$
View full question & answer→
MCQ 71 Mark
The objective of sequence problem is
  • A
    to find the order in which jobs are to be made
  • B
    to find the time required for the completing all the job on hand
  • ✓
    to find the sequence in which jobs on hand are to be processed to minimize the total time required for processing the jobs
  • D
    to maximize the cost
Answer
Correct option: C.
to find the sequence in which jobs on hand are to be processed to minimize the total time required for processing the jobs
to find the sequence in which jobs on hand are to be processed to minimize the total time required for processing the jobs
View full question & answer→
MCQ 81 Mark
If job A to D have processing times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on the second machine then the optimal sequence is:
  • A
    CDAB
  • ✓
    DBCA
  • C
    BCDA
  • D
    ABCD
Answer
Correct option: B.
DBCA
DBCA
View full question & answer→
MCQ 91 Mark
The objective of an assignment problem is to assign
  • A
    Number of jobs to equal number of persons at maximum cost
  • ✓
    Number of jobs to equal number of persons at minimum cost
  • C
    Only the maximize cost
  • D
    Only to minimize cost
Answer
Correct option: B.
Number of jobs to equal number of persons at minimum cost
Number of jobs to equal number of persons at minimum cost
View full question & answer→
MCQ 101 Mark
In a 3 machine and 5 jobs problem, the least of processing times on machines A, B, and C are 5, 1 and 3 hours and the highest processing times are 9, 5 and 7 respectively, then it can be converted to a 2 machine problem if the order of the machines is:
  • A
    $B-A-C$
  • ✓
    $A-B-C$
  • C
    $C - B - A$
  • D
    Any order
Answer
Correct option: B.
$A-B-C$
$A-B-C$
View full question & answer→
MCQ 111 Mark
In an assignment problem if the number of rows is greater than the number of columns then
  • ✓
    Dummy column is added
  • B
    Dummy row is added
  • C
    Row with cost 1 is added
  • D
    Column with cost 1 is added
Answer
Correct option: A.
Dummy column is added
Dummy column is added
View full question & answer→
MCQ 121 Mark
The assignment problem is said to be balanced if it is a
  • ✓
    Square matrix
  • B
    Rectangular matrix
  • C
    Unit matrix
  • D
    Triangular matrix
Answer
Correct option: A.
Square matrix
Square matrix
View full question & answer→
MCQ 131 Mark
The assignment problem is said to be balanced if
  • A
    Number of rows is greater than the number of columns
  • B
    Number of rows is lesser than number of columns
  • ✓
    Number of rows is equal to the number of columns
  • D
    If the entry of rows is zero
Answer
Correct option: C.
Number of rows is equal to the number of columns
Number of rows is equal to number of columns
View full question & answer→
MCQ 141 Mark
In sequencing, an optimal path is one that minimizes ___________
  • A
    Elapsed time
  • B
    Idle time
  • ✓
    Both (a) and (b)
  • D
    Ready time
Answer
Correct option: C.
Both (a) and (b)
Both (a) and (b)
View full question & answer→
Generate Paper FreeAll Assignment Problem and Sequencing (p-2) topics