BCOM Maths-1 MCQ's




Question 61 :
A student is to answer 8 out of 10 question in an examination. How many ways he can answer if he must answer the first three questions.

  1. 45
  2. 54
  3. 21
  4. 12
  

Question 62 :
The value of 5C4 × 4C2 is

  1. 30
  2. 1440
  3. 1040
  4. 4140
  

Question 63 :
A box contains 6 red and 5 blue balls. 3 balls are to be picked at random. The no. of ways of choosing all 3 red ball is _____.

  1. 20
  2. 10
  3. 165
  4. 8.25
  

Question 64 :
4 women and a man are to be seated in a row for a photograph. The number of arrangements possible with the man at the center is _____.

  1. 120
  2. 4
  3. 24
  4. 8
  

Question 65 :
The value of 8P3 + 7P2 is

  1. 654
  2. 645
  3. 564
  4. 378
  

Question 66 :
4 assignments have to be given to 4 students, one each. The number of ways of doing this is _____.

  1. 1
  2. 256
  3. 8
  4. 24
  

Question 67 :
The value of 10C3 + 8C2 is

  1. 148
  2. 184
  3. 841
  4. None of these
  

Question 68 :
3 books on mathematics, 2 on economics and 4 on accounts are to be arranged on a shelf. The number of arrangements possible if books of the same subject are together is _____.

  1. 288
  2. 362880
  3. 1728
  4. None of these
  

Question 69 :
Consider an event of drawing a card from a pack of 52 cards. Find the number of ways in which a card drawn is either a diamond or a heart.

  1. 169
  2. 104
  3. 26
  4. None of these
  

Question 70 :
In how many different ways can 4 ladies and 3 gentlemen be seated in a row, so that no two ladies sit together?

  1. 240
  2. 420
  3. 34
  4. None of these
  

Question 71 :
A team of 2 teachers and 4 students have to be selected from a group of 4 teachers and 7 students and sent for a conference. The number of different teams possible is

  1. 10080
  2. 210
  3. 41
  4. None of these
  

Question 72 :
The number of 3 letter words that can be arranged using the letters of the word ‘FLOWER’ exactly once is _____.

  1. 20
  2. 720
  3. 120
  4. 6
  

Question 73 :
How many different numbers of 3 digits can be formed with the digits 2, 4, 5, 6, 7, 8, none of the digits being repeated in any of the numbers so formed.

  1. 3P2
  2. 6P3
  3. 102
  4. None of these
  

Question 74 :
A family of 3 daughters and 5 sons is to be arranged for a photograph in one row. In how many ways can they be seated of no two daughters sit together?

  1. 6! × 3!
  2. 14400
  3. 3! × 5P4
  4. 5! × 6P3
  

Question 75 :
For any two natural numbers n and r such that n > r, nPr ….. nCr

  1. £
  2. ³
  3. #ERROR!
  4. >
  

Question 76 :
From 4 officers and 8 clerks in how many ways can 6 be chosen to include exactly an officer is _____.

  1. 224
  2. 4
  3. 8
  4. 48
  

Question 77 :
The linear programming program Maximize Z = 2x1 + 3x2 Subject to 3x1 + x2 ≤ 5 x1 + x2 ≤ 4 x1 , x2 ≥ 0 has optimum feasible solution at point _____.

  1. (0, 4)
  2. (5/2 , 0)
  3. (1, 3)
  4. (0, 0)
  

Question 78 :
_____ are the unknown variable x1, x2, x3… to be determined as the optimal feasible solution of the linear programming problem.

  1. Decision variables
  2. Parameters
  3. Objective Function
  4. Constraint
  

Question 79 :
For the L.P.P. Max. Z = 4x + 3y Subject to 2x + 3y ≤ 4 3x + y ≤ 5 x ≥ 0, y ≥ 0 feasible region is in the _____.

  1. First Quadrant
  2. Second Quadrant
  3. Third Quadrant
  4. Fourth Quadrant
  

Question 80 :
The linear Programming Problem Maximize Z = 12x1 + 42x2 Subject to­ x1 + 2x2 ≥ 3 x1 + 4x2 ≥ 4 x1 ≥ 0, x2 ≥ 0 has optimum feasible solution at point _____.

  1. (0, 1.5)
  2. (2, 1/2)
  3. (4, 0)
  4. (0, 0)
  

Question 81 :
_____ is a mathematical technique to optimize the objective function subjected to constraints.

  1. Linear Programming Problem
  2. Feasible Solution
  3. Model
  4. Non-negativity Condition
  

Question 82 :
_____ is the region defined by constraints and the non-negativity conditions on the graph

  1. Solution
  2. Feasible region
  3. Picture
  4. Area
  

Question 83 :
_____ of the feasible region that optimizes the objective function Z is called _____.

  1. Corners, feasible solution
  2. Vertices, Optimal
  3. Feasible Solution
  4. Boundary, optimal feasible solution
  

Question 84 :
_____ is a mathematical technique to optimize the objective function subjected to constraints.

  1. Linear Programming Problem
  2. Feasible Solution
  3. Model
  4. Non-negativity Condition
  

Question 85 :
_____ is the region defined by constraints and the non-negativity conditions on the graph

  1. Solution
  2. Feasible region
  3. Picture
  4. Area
  

Question 86 :
For the L.P.P. Max. Z = 4x + 3y Subject to 2x + 3y ≤ 4 3x + y ≤ 5 x ≥ 0, y ≥ 0 feasible region is in the _____.

  1. First Quadrant
  2. Second Quadrant
  3. Third Quadrant
  4. Fourth Quadrant
  

Question 87 :
_____ of the feasible region that optimizes the objective function Z is called _____.

  1. Corners, feasible solution
  2. Vertices, Optimal
  3. Feasible Solution
  4. Boundary, optimal feasible solution
  

Question 88 :
_____ are the unknown variable x1, x2, x3… to be determined as the optimal feasible solution of the linear programming problem.

  1. Decision variables
  2. Parameters
  3. Objective Function
  4. Constraint
  

Question 89 :
The linear programming program Maximize Z = 2x1 + 3x2 Subject to 3x1 + x2 ≤ 5 x1 + x2 ≤ 4 x1 , x2 ≥ 0 has optimum feasible solution at point _____.

  1. (0, 4)
  2. (5/2 , 0)
  3. (1, 3)
  4. (0, 0)
  

Question 90 :
The linear Programming Problem Maximize Z = 12x1 + 42x2 Subject to­ x1 + 2x2 ≥ 3 x1 + 4x2 ≥ 4 x1 ≥ 0, x2 ≥ 0 has optimum feasible solution at point _____.

  1. (0, 1.5)
  2. (2, 1/2)
  3. (4, 0)
  4. (0, 0)
  
Pages