MTH202 Solved Mcq’s from past papers
MTH202 Solved Mcq’s from past papers.
- How many functions are there from a set with
three elements to a set with two elements?
► 6
► 8
► 12
- If a pair of dice is thrown then the
probability of getting a total of 5 or 11 is
► 1/8
► 1/9
► 1/6
- Among 200
people, 150 either swim or jog or both. If 85 swim and 60 swim and jog,
how many jog?
► 125 (Page 241)
► 225
► 85
► 25
- If P (A∩ B)
P (A)
P (B) then the events A and B are called
► Independent
► Dependent
► Exhaustive
- Whether the relation R on the set of all
integers is reflexive, symmetric, ant symmetric, or transitive,
Where
(X, y)∈R
If and only if
xy ≥1
Ø Anti symmetric
Ø Transitive
Ø Symmetric
Ø Both Symmetric and
transitive
- For a binary relation R defined on a set A,
if for all
t ∈ A, (t, t)∉R
Then R is
Ø Anti symmetric
Ø Symmetric
Ø Irreflexive (Page 77)
- In how many ways can a set of five letters be
selected from the English Alphabets?
Ø C(26,5)
Ø C(5,26)
Ø C(12,3)
Ø None of these
- The value of (-2)! Is
Ø 0
Ø 1
Ø Cannot be determined (Page
217)
- The value of [x] for -2.01 is
Ø -3
Ø 1
Ø -2 (Page 249)
- A die is thrown twice. What is the
probability that the sum of the number of dots shown is 3 or 11?
► 2/3
► 1/9
► 1/2
- The indirect proof of a statement p q
involves
Ø Considering ~q and then try to reach ~p
Ø Considering p and ~q and try to reach contradiction
Ø Both 2 and 3 above (Not sure)
Ø Considering p and then try to
reach q
- Which of the following
graphs are tree?
Ø a, b, c
Ø b, c,
d
Ø c, d,
e
Ø a , c, e
Graph a is missing …
- In the planar graph, the graph crossing
number is
Ø 0 (Page 314)
Ø 1
Ø 2
Ø 3
- Changing rows of matrix into columns is
called
Ø Symmetric Matrix
Ø Transpose of Matrix (Page 299)
Ø Adjoint of Matrix
- When 5k is even, then 5k+5k+5k is odd.
Ø True
Ø False
- 5n -1 is divisible by 4 for all positive
integer values of n.
Ø True
Ø False
- An integer n is called a perfect square if
and only if n = k2 for some integer k.
Ø True (Page 187)
Ø False
Ø Depends on the value of k
- The relation as a set of ordered pairs as
shown in figure is
► {(a,b),(b,a),(b,d),(c,d)}
► {(a,b),(b,a),(a,c),(b,a),(c,c),(c,d)}
► {(a,b), (a,c), (b,a),(b,d), (c,c),(c,d)}
► {(a,b), (a,c),
(b,a),(b,d),(c,d)}
- If a die
is thrown then the probability that the dots on the top are prime numbers
or odd numbers is
1
1 / 2
2/3
Prime number or odd number =1,3,5
Total outcomes =6
Probability = 3/6=1/2
- If A, B
and C are any three events, then
P(AUBUC) is equal to
► P(A) + P(B) + P(C)
► P(A) + P(B) + P(C)- P(AUB) - P (A UC) - P(B UC) + P(A
UB UC) (Page 264)
► P(A) + P(B) + P(C) -
P(AUB) - P (A UC) - P(B UC)
► P(A) + P(B) + P(C) + P(A NB NC)
- A circuit
that consist of a single vertex is called
► Trivial (Page 322)
► Tree
► Empty
- How many
ways are there to select five players from a 10 member tennis team to make
a trip to a match to another school?
► C(10,5)
► C(5,10)
► P(10,5)
► None of these
- The value
of 0! Is
► 0
► 1
- If the order does not matter and repetition
is allowed then total number of ways for selecting k sample from n. is
Ø nk
Ø C(n+k-1,k) (Page 229)
Ø P(n,k)
Ø C(n,k)
- A tree diagram is a useful tool to list all
the logical possibilities of a sequence of events where each event can
occur in a finite number of ways.
Ø True (Page 237)
Ø False
- Two distinct edges with the same set of end
points are called
Ø Isolated
Ø Incident
Ø Parallel (Page 284)
No comments: