Engineering Maths MCQ with Answers Set-2

This post contains a computer network related to 20 multiple-choice questions (EM SET-2) that help you to go through the subject and prepare you for engineering maths-related questions in a competitive exam.

Engineering Maths MCQ Test Series Set-2

  • Total Number of Questions: 20

  • Each question carries equal marks i.e 1

  • No Negative Marking

Page 1 of 2

1. Which one of the following is a closed-form expression for the generating function of the sequence $\left\{ a_{n} \right\}$, where $a_{n} = 2n+3$ for all n = 0,1,2,...... ?
A.
B.
C.
D.
2. Let p, q, r, s represent the following propositions.

p: x $\in$ {8,9,10,11,12}

q: x is a composite number

r: x is a perfect square

s: x is a prime number

The integer $x\ge 2 $ which satisfies $\rightharpoondown \left( p\Rightarrow q \right)\wedge (\rightharpoondown rV\rightharpoondown s)$ is
A.
B.
C.
D.
3.

Let $C_{1},…, C_{n}$ be scalars, not all zero, such that  $\sum_{i=1}^{n}c_{i}a_{i} = 0$where $a_{i} $ are column vectors in $R^{n}$.

Consider the set of linear equations

Ax=b

where A = $[a_{1},…, a_{n}]$ and b = $\sum_{i=1}^{n}a_{i} = 0$, the set equation is:

A.
B.
C.
D.
4. $\lim_{x \to 0} \frac{sin(x-4)}{x-4}$ = _____.
A.
B.
C.
D.
5.

Compute $\lim_{x \to 3}\frac{x^{4}-81}{2x^{2}-5x-3}$

A.
B.
C.
D.
6. Consider a matrix P whose only eigenvectors are the multiples of $\left[ \frac{1}{4} \right]$. Consider the following statements.

(I) P does not have an inverse

(II) P has a repeated eigenvalue

(III) P cannot be diagonalized

Which one of the following options is correct?
A.
B.
C.
D.
7. Let N be the set of natural numbers. Consider the following sets.

P: Set of Rational numbers (positive and negative)

Q: Set of functions from {0, 1} to NR: Set of functions from N to {0, 1}

S: Set of finite subsets of N.

Which of the sets above are countable?
A.
B.
C.
D.
8.

Assume that multiplying a matrix $G_{1}$ of dimension p x q with another matrix $G_{2}$  of dimension q x r requires pqr scalar multiplications. Computing the product of n matrices $G_{1}G_{2}G_{3}$ ................ $G_{n}$ can be done by parenthesizing in different ways. Define $G_{i}G_{i+1}$ as an explicitly computed pair for a given paranthesization  if they are directly multiplied. For example, in the matrix multiplication chain $G_{1}G_{2}G_{3}G_{4}G_{5}G_{6}$  using paranthesization $(G_{1}(G_{2}G_{3}))(G_{4}(G_{5}G_{6}))$, $G_{2}G_{3}$ and $G_{5}G_{6}$ are the only explicitly computed pairs.

Consider a matrix multiplication chain $F_{1}F_{2}F_{3}F_{4}F_{5}$, where matrices $F_{1},F_{2},F_{3},F_{4}$ and $F_{5}$ are of dimensions 2 x 25, 25 x 3 , 3 x 16, 16 x 1 and 1 x 1000, respectively. In the paranthesization of $F_{1}F_{2}F_{3}F_{4}F_{5}$ that minimizes the total number of scalar multiplications, the explicitly computed pairs is/are

A.
B.
C.
D.
9. The value of $\lim_{x \to 1}\frac{x^{7}-2x^{5}+1}{x^{3}-3x^{2}+2} $
A.
B.
C.
D.
10.

Let p,q, and r be propositions and the expression $(p\rightarrow q)\rightarrow r$ be a contradiction. Then, the expression $(r\rightarrow p)\rightarrow q$ is

A.
B.
C.
D.

 

Subscribe
Notify of
guest

0 Comments
Inline Feedbacks
View all comments