0% found this document useful (0 votes)
182 views8 pages

MCQ (MTH107)

This document contains two multiple choice practice tests with questions about matrices, linear algebra, linear programming, and sets. The first test has 5 questions about matrices and their properties including multiplying matrices by scalars, finding the product of eigenvalues, and determining the rank of a given matrix. The second test has 9 additional matrix questions and introduces topics from linear programming including canonical forms, the simplex method, slack and surplus variables, and determining whether a solution is basic feasible or optimal. Both tests conclude with questions about set theory including set operations, truth tables, power sets, and word problems about voting in a contest to determine the total number of voters. The documents provide practice questions that assess understanding of key concepts across multiple

Uploaded by

anurag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
182 views8 pages

MCQ (MTH107)

This document contains two multiple choice practice tests with questions about matrices, linear algebra, linear programming, and sets. The first test has 5 questions about matrices and their properties including multiplying matrices by scalars, finding the product of eigenvalues, and determining the rank of a given matrix. The second test has 9 additional matrix questions and introduces topics from linear programming including canonical forms, the simplex method, slack and surplus variables, and determining whether a solution is basic feasible or optimal. Both tests conclude with questions about set theory including set operations, truth tables, power sets, and word problems about voting in a contest to determine the total number of voters. The documents provide practice questions that assess understanding of key concepts across multiple

Uploaded by

anurag
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 8

MCQ MTH107 ( set 1)

Unit 4

1. To multiply a matrix by 2, multiply

(a) any row by 2 (b) every element by 2 (c) any column by 2 (d) none of these.

2. Matrix has a value. This statement is

(a) always true (b) depend upon the matrices (c) false (d) none of these.

3 1 4
 5
3. The product of the Eigen values of 0 2  is

0 0 5

(a) 10 (b) 20 (c) 30 (d) none of these

 8 6 2 
  4 are 2 and 13, then the third value is
4. If two Eigen values of  6 7
 2 4 3 

(a) 0 (b) 3 (c) 2 (d) 4

1 2 3
 2 is
5. The rank of matrix 1 4
2 4 6 

(a) 3 (b) 2 (c) 1 (d) 0

UNIT 5

Q1. Which of the following is NOT a part of every linear programming problem
formulation?

a. An objective function
b. A set of constraints
c. Non-negativity constraints
d. A redundant constraint

Q2. All the constraints are expressed as less than inequality on the right hand side of
each constraint and all variables are non-negative is called ---------------
0
a. Canonical form
b. Standard form
c. Canonical solution
d. Both A and B
Q3. In a maximization problem, when one or more of the solution variables and the
profit can be made infinitely large without violating any constraints, then the linear
program has

a. An infeasible solution
b. An unbounded solution
c. An feasible solution
d. Alternate optimal solutions

Q4. If the feasible region of a LPP is empty, the solution is --------------------


a. Infeasible
b. Unbounded
c. Alternative
d. None of the above

Q5. A Basic Feasible Solution of a LPP is said to be ---------------- if at least one of the
basic variable is zero

a.Degenerate
b.Non-degenerate
c.Infeasible
d.Unbounded

Q6. Every LPP associated with another LPP is called -----------------


0 Primal
1 Dual
2 Non-linear programming
3 None of the above

Q7. Any solution to a LPP which satisfies the non- negativity restrictions of the LPP is
called its --------
0 a. Unbounded solution
1 b. Optimal solution
2 c. Feasible solution
3 d. Both A and B

Q8. Any feasible solution which optimizes (minimizes or maximizes) the objective
function of the LPP is called its ----------------
0 a. Optimal solution
1 b. Non-basic variables
2 c. Solution
3 d. Basic feasible solution

Q9. All the constraints are expressed as equations on the right hand side of each
constraint and all variables are non-negative is called ---------------
a. Canonical variable
b. Standard form
c. Canonical solution
d. Both A and B
Q10. In a primal form, if the problem is of maximization, all the constraints involve
the sign of
(a) 
(b) 
(c ) =
(d) unrestricted.

Unit 6
1.  A  B  c  A c  B c is
(a) complement law (b) absorption law (c) De Morgan’s law (d) distributive law

2. if p be “it is hot and q be ‘ it is raining’ then q   p represent the statement

(a) it is not hot and it is not raining


(b) it is raining or it is not hot
(c ) it is hot but not raining
(d) none of these

3.
p q Output

T T T

T F F This table is the truth table of

F T F

F F F

(a) AND (b) OR (c) NOT (d) conditional

4. The members of the set S = {x | x is the square of an integer and x < 100} is _________________.
a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}

5. Power set of empty set has exactly _____ subset.


a) One
b) Two
c) Zero
d) Three

MCQ MTH107 ( set 2)

Unit 4
1.For any 2 x 2 matrix A, if A(Adj A)= , then

a) 0 b) 10 c) 20 d) 100

2.The eigen values of a matrix are

a) 3 and 0 b) 3 and -7 c) -5 and 1 d) 3 and -5

3.The system of equations 3x + y +2z = 3, 2x – 3y –z = -3, x + 2y + z = 4 has the solution

a) 2, 1, -2 b) 1, 1, 1 c) 1, 4, -2 d) 1, 2, -1

4.If x1=(1,1,1,3), x2=(1,2,3,4) and x3=(2,3,4,7) are vectors ,Which of following is false:

a. X1,x2 and x3 are Linearly independent.


b. X1,x2 and x3 are Linearly dependent.
c. X1,x2 and x3 are Linearly dependent and x1+x2-x3=0.
d. X1,x2 and x3 are Linearly dependent and x1+x2=x3.

5.The eigen values of A= are

a. 1,-3,-4 b. 1,3,4 c. -1,3,4 d. 1,-3,4

6.If A= and 2 is eigen value of A, the eigen vector corresponding to 2 is :

a. [1 -1 0]t b. [1 2 1]t c. [1 2 2]t d. [1 -1 1]t

7.A matrix is an upper triangular matrix if

a) it is a square matrix and b) it is a square matrix and

c) it is not a square matrix and d) it is not a square matrix and

8.The characteristic equation of the matrix is

a) b) c) d)
9. Consider the system of equations , by
Crammer rule the system will have a unique solution if

a) can have any value b)

c) d) None of these

Unit 5

1.According to algebra of simplex method, the slack variables are assigned zero coefficients because they make

a) No contribution in objective function


b) High contribution in objective function
c) Divisor contribution in objective function
d) Base contribution in objective function

Ans-a

2.The cannonical form of

Max z = 2x1 + 3x2


x1 – x2 ≤ 2
x1 + x2 ≥ 4
x1, x2 ≥ 0 is
a) Max z = 2x1 + 3x2
x1 – x2 ≤ 2
- x1 - x2 ≤ -4
x1, x2 ≥ 0
b) Max z = 2x1 + 3x2
x1 – x2 ≤ 2
x1 + x2 ≤ - 4
x1, x2 ≥ 0
c) Max z = 2x1 + 3x2
x1 – x2 - s 1 = 2
x 1 + x 2 + s2 = 4
x1, x2, s1, s2 ≥ 0
d) Max z = 2x1 + 3x2
x 1 – x 2 + s1 = 2
x 1 + x 2 – s2 = 4
x1, x2, s1, s2 ≥ 0

Ans-a

3.Which of these can be a basic feasible non-degenerate solution of a system with 4 variables and 2
constraints?

a) (1, 0, 0, -3)
b) (1, 2, 3, 0)
c) (1, 0, 0, 3)
d) (0, 0, 2, 0)
4.Any feasible solution which maximizes (or minimizes) the objective function of L.P.P is called its

a. Basic solution b. optimal solution c. standard solution d. none of these

Ans-b

5.If the constraints of a general L.P.P be which satisfy

are called

a.Basic variables b. surplus variables c. slack variables d. none of these

Ans-b

6.The dual of L.P.P Maximize Z=4x1+9x2+2x3 s.t 2x1+3x2+2x3 7,3x1-2x2+4x3=5 ,x1,x2,x3 0 has

a. 2 constraints b. 3 constraints c. 4 constraints d. 5constraints


Ans-A

7. In case of LPP, the inequalities of the constraints of the type can be converted

to equalities by subtracting which variables

a) surplus variables b) artificial variable c) decision variable d) slack variable

Ans-a

8. .Which of the following is a valid objective function for the linear programming problem?

a) b) c) d)

Ans-a

9. In the simplex method, the entering variable in the below given table is

5 3 0 0 0
Basic Basic
Variables Solution
0 2 1 1 1 0 0
0 12 5 2 0 1 0
0 12 3 8 0 0 1

a) b) c) d)

Ans-a
Unit 6

1.Which of the following are well defined sets?

a) All the points that lie on a straight line


b) All the tall boys of a school
c) All the hard working teachers in a college
d) All the efficient doctors of a hospital

Ans-a

2.In a beauty contest, half the number of experts voted for Mr. A and two thirds voted for Mr. B. 10 voted for
both and 6 did not vote for either. How many experts were there in all?

a) 24 b)36 c)18 d)None of these

3.In a Venn diagram, the overlap between two circles represents

a) The union of two sets


b) The intersection of two sets
c) The elements that are in either of two sets
d) The difference between the number of elements in two sets

4.Which of following is not proposition

a).2+2=4 b.) Delhi is capital of India c.) Shimla is in India d. )Where do you live ?

5.An expression involving logical variables which is false for all cases in its truth table is

a. Conditional operator
b. Bi-conditional statement
c. Tautology
d. Contradiction
Ans=d

6.Two statements p and q are equivalent if

a. p q is tautology

b. p q is tautology

c. p q contradiction

d. p q is tautology
Ans-d

7.If A and B are two sets, then is equal to

a) A b) B c) d) None of these

8. If A, B and C are any three sets then is equals to


a) b) c) d)

9.Which set is the subset of all given sets?

a) b) c) d)

10. The truth table for is

a) b) c) d)

1 1 0 1 1 1 1 1 1 1 1 0
1 0 1 1 0 0 1 0 0 1 0 1
0 1 0 0 1 1 0 1 0 0 1 1
0 0 0 0 0 1 0 0 0 0 0 1

You might also like