MTH202 FinalTerm Most Important Repeated Mcqs Online Quiz

MTH202 FINALTERM MOST IMPORTANT REPEATED MCQS ONLINE QUIZ

MTH202 quiz helps us to increase our knowledge

1 / 23

The value of C(n, 0) =

2 / 23

How many ways are there to select a first prize winner a second prize winner, and a third prize winner
from 100 different people who have entered in a contest.

3 / 23

The negation of “Today is Friday” is

4 / 23

The value of 0! Is

5 / 23

The greatest common divisor of 27 and 72 is

6 / 23

The method of loop invariants is used to prove correctness of a loop with respect to certain pre and postconditions

7 / 23

Let n and d be integers and d ¹ 0. Then n is divisible by d or d divides n
If and only if

8 / 23

A rule that assigns a numerical value to each outcome in a sample space is called

9 / 23

Contra positive of given statement “If it is raining, I will take an umbrella” is

10 / 23

Euler formula for graphs is

11 / 23

When P(k) and P(k+1) are true for any positive integer k, then P(n) is not true for all +ve Integers

12 / 23

Any two spanning trees for a graph

13 / 23

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?

14 / 23

The power set of a set A is the set of all subsets of A, denoted P(A).

15 / 23

A rule that assigns a numerical value to each outcome in a sample space is called

16 / 23

What is the expectation of the number of heads when three fair coins are tossed?

17 / 23

If A and B are two disjoint (mutually exclusive)
events then P(AUB) =

18 / 23

A circuit with one input and one output signal is called.

19 / 23

When 5k
is even, then 5k
+5k
+5k
is odd.

20 / 23

When 3k
is even, then 3k
+3k
+3k
is an odd.

21 / 23

A matrix in which number of rows and columns are equal is called

22 / 23

In the planar graph, the graph crossing number is

23 / 23

A sub graph of a graph G that contains every vertex of G and is a tree is called

Your score is

The average score is 0%

0%