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. Which of the following can be consider as discrete objects?

Integers
Rational numbers
people
All of the above

2. What Z+ represents?

the set of all rational numbers
the set of all positive integers
the set of all whole numbers
the set of all real numbers

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

4. What is Space Complexity for Binary search tree?

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

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. When we perform an experiment, then the set S of all possible outcomes is called the?

Random Experiment
Event
Sample Space
Tossing Space

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

180
720
360
540

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

Babylonians
G. Cantor
George Boole
Konrad Zuse

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

counting theory
relations
finite state machines
All of the above

10. If function is both surjective and injective then it is known as?

invertible
composition
bijective
associative

Results