Discrete Mathematics Quiz

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

2. Relations may exist between?

objects of the same set
between objects of two or more sets.
Both A and B
None of the above

3. A tree with N number of vertices contains?

(N-1) Edges
(N^2)-1 Edges
N Edges
(N+1) Edges

4. Boolean algebra can be used ____________

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

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

6. If a coin is tossed, how many possible outcomes?

1
2
3
4

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

TRUE
FLASE
either true or false
cannot determined

8. A function can not be?

one to one
many to one
one to many.
All of the above

9. A bag contains 5 red balls and some blue balls .If the probability of drawing a blue ball is double that of a red ball, then the number of blue balls in a bag is:

5
10
15
20

10. How many bits string of length 4 are possible such that they contain 2 ones and 2 zeroes?

4
5
6
7