Discrete Mathematics Quiz

1. What is Space Complexity for Binary search tree?

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

2. What is Null Graph?

A null graph has no nodes
null graph has no edges
null graph has no odd vertex
null graph has no even vertex

3. The power set of an empty set is?

0
1
2
empty set

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

Irreflexive
Reflexive
Anti-Symmetric
Symmetric

5. Composition does not hold?

associative property
commutative property
one-to-one function
Both A and B

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

7. Boolean algebra deals with variables that can have?

two discrete values
three discrete values
four discrete values
five discrete values

8. A set can be written explicitly by listing its elements using?

()
[]
{}
" "

9. f:N->N,f(x)=5x is?

injective
not injective
surjective
inverse

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

1
2
3
4