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.

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. Triangle free graphs have the property of clique number is __________

More than 10
less than 5
equal to 5
greater than 3

2. 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

3. Which of the following option is true?

If the Sun is a planet, elephants will fly
3 +2 = 8 if 5-2 = 7
1 > 3 and 3 is a positive integer
-2 > 3 or 3 is a negative integer

4. number of edges incident with the vertex V is called?

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

5. In how many categories, Mathematics can be broadly classified into?

2
3
4
5

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

35
36
37
38

7. If a tree has only one eccentricity, it is called

Bi-Centers
Labeled Trees
Rooted Tree
Central Tree

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

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

9. Number of edges incident with the vertex V is called?

Degree of a Graph
Handshaking Lemma
Degree of a Vertex
None of the above

10. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be

180
720
360
540

Results