Discrete Mathematics Quiz


Play this quiz that will help you to excel in Discrete Mathematics certification exams, placements etc. This Discrete Mathematics quiz consist of 10 questions that you need to solve in 10 minutes. We’ve specially designed this quiz so that you can quickly acquaint to the pattern of questions you can be asked in placement drives, certification exams etc.

Discrete Mathematics

Bestseller by Udemy

You will learn the fundamentals of Set Theory including set builder notation, and set operations and properties.

19 Hours
Paid

Take the Free Practice Test



Discrete Mathematics MCQs

Practice Discrete Mathematics MCQ Questions, which will help you to understand programming related Mathematical concepts and also helps you to prepare for placements, technical rounds, interviews, competitive exams etc.

Discrete Mathematics Quiz

Try Free Discrete Mathematics Quiz, to start a quiz you need to login first, after login you will get start quiz button and then by clicking on that you can start quiz. You will get 10 Minutes to answer all questions.

Discrete Mathematics Quiz

1. In how many ways, sets can be represented?

2
3
4
5

2. Composition does not hold?

associative property
commutative property
one-to-one function
Both A and B

3. A relation can be represented using a?

Indirected graph
Pie graph
Directed graph
Line graph

4. Which of the following involves distinct values i.e. between any two points?

Continuous Mathematics
Non-Continuous Mathematics
Non-Discrete Mathematics
Discrete Mathematics

5. If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.

35
36
37
38

6. For two distinct sets, A and B, having cardinalities m and n respectively, the maximum cardinality of a relation R from A to B is ?

m+n
m*n
m^n
None of the above

7. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________

O(n)
O(logn)
O(n^3)
O(n^2)

8. What is Space Complexity for Binary search tree?

O(n)
O(log n)
O(n^2)
O(nlog n)

9. Which Boolean Identities law proof A+A=A ?

Idempotent Law
Complement Law
Double Complement Law
Identity Law

10. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x + 4. Then the composition of f and g is ____________

6x+9
6x+7
6x+3
6x+8

Results