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 a tree has only one eccentricity, it is called

Bi-Centers
Labeled Trees
Rooted Tree
Central Tree

2. The graph in which, there is a closed trail which includes every edge of the graph is known as?

Hamiltonian Graphs
Euler Graphs
Planar graph
Directed Graph

3. Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?

{(a,b) | a >= b and a, b belong to {1, 2, 3}}
{(a,b) | a > b and a, b belong to {1, 2, 3}}
{(a,b) | a <= b and a, b belong to {1, 2, 3}}
{(a,b) | a = b and a, b belong to {1, 2, 3}}

4. The earliest method of manipulating symbolic logic was invented by?

Babylonians
G. Cantor
George Boole
Konrad Zuse

5. The number of labeled trees of k number of vertices is?

k^(n-1)
k^(n-2)
k^(2)
k^(n)

6. Set theory forms the basis of several other fields of study like?

counting theory
relations
finite state machines
All of the above

7. Discrete probability distribution depends on the properties of ___________

discrete variables
probability function
machine
data

8. A={a,e,i,o,u} is an example of?

Roster Form
Set Builder Notation
Both A and B
None of the above

9. A relation R on set A is called _________ if xRy implies yRx.

Irreflexive
Reflexive
Anti-Symmetric
Symmetric

10. 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)

Results