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. If f and g are onto then the function (gof) is?

one to one
onto
one to many.
into

2. F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is ________

2
3
4
5

3. Boolean algebra can be used ____________

For designing of the digital computers
In building logic symbols
Circuit theory
Building algebraic functions

4. The Karnaugh map (K–map), introduced by Maurice Karnaughin in?

1952
1950
1956
1953

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

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

6. A linear graph consists of vertices arranged in a line.

TRUE
FLASE
either true or false
cannot determined

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

Idempotent Law
Complement Law
Double Complement Law
Identity Law

8. When we perform an experiment, then the set S of all possible outcomes is called the?

Random Experiment
Event
Sample Space
Tossing Space

9. Which of the following is true about Handshaking Lemma?

In Handshaking lemma, If the degree of a vertex is even, the vertex is called an even vertex
The degree of a graph is the largest vertex degree of that graph.
The degree of a vertex is odd, the vertex is called an odd vertex.
The sum of all the degrees of all the vertices is equal to twice the number of edges.

10. Graph consists of a?

non-empty set of vertices
empty set of vertices
Both A and B
None of the above

Results