MTH202 - Discrete Mathematics

All MCQs Tests - VU MTH202 - Discrete Mathematics

Start

Subject	MTH202 - Discrete Mathematics			Chapter / Term	All MCQs
Quiz No	1	Total Time	10 Minute(s)	No. of Questions	10 Question(s)

Start Test Now

Chapter / Term

Time

Question(s)

Q1

Question 1: The method of loop invariants is used to prove __________ of a loop with respect to certain pre and post-conditions.

falseness

correctness

Q2

Question 2: Let X = {2, 4, 5} and Y= {1, 2, 4} and R be a relation from X to Y defined by R = {(2,4), (4,1), (a,2)}. For what value of 'a' the relation R is a function ?

Q3

Question 3: If p is false and q is true, then ∼p ↔ q is __________.

TRUE

FALSE

Q4

Question 4: Let X = {1, 2, 3}, then 2-combinations of the 3 elements of the set X are __________?

{1, 2}, {1, 3} and {2, 3}

{1, 2}, {2, 1}, {1, 3}, {3, 1}, {2, 3}, and {3, 2}

{1, 2}, {2, 1}, {1, 3} and {2, 3}

{1, 2}, {2, 1},{1, 3} and {3, 1}

Q5

Question 5: Let f is defined recursively by
F(0)=3
F(n+1)=2f(n)+2
Then f(2)=

Q6

Question 6: Let f and g be the functions defined by f(x)= 2x+3 g(x)= 3x+2 then composition of f and g is

6x+6

5x+5

6x+7

None of the given options

Q7

Question 7: A non-zero integer d divides an integer n if and only if there exists an integer k such that __________.

n = d / k

n = d k

n = d + k

n = d - k

Q8

Question 8: A student can choose a computer project from one of the two lists. The two lists contain 12 and 18 possible projects, respectively. How many possible projects are there to choose from?

216