Home > B.Sc (CS) > Quizzes > Discrete Mathematics
Discrete Mathematics
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 15% Most missed: “Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A=…”
Discrete Mathematics
Time left 00:00
25 Questions

1. Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R composition S=____.
2. The set of all finite words over E is denoted by ________.
3. Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____.
4. If there are more than 2 LMD for a string then it is said to be ___________.
5. A directed complete graph of n vertices contains __________.
6. The set of all divisors of 24 are ___________.
7. If G is a connected planar graph then it has a vertex of degree _______.
8. A finite non-empty set of symbols is called _________.
9. If R= {(x, 2x)} and S= {(x, 4x)} then R composition S=____.
10. A set containing no element is called ____________.
11. A connected graph that has no cut vertices is called a ________.
12. The eccentricity of a center in a tree is defined as ______ of the tree.
13. One to one onto function is also called __________.
14. A product of the variables and their negations in a formula is called _________.
15. If P then Q is called _________ statement
16. If R= {(x, 2x)} and S= {(x, 5x)} then R composition S=____.
17. A graph is planar if and only if it does not contain ________.
18. Let R ={ (a,b),(c,d),(b,b)}, S = {(d,b),(c,b),(a,d)} then R composite S = ___________
19. If a normal form contains all minterms, then it is ________.
20. If a node v is reachable from node u then the path of minimum length u to v is called _____.
21. A self complemented distributive lattice is called _______.
22. The total number of degrees of an isolated node is _______.
23. A path of a graph is said to be ______ if it contains all the edges of the graph.
24. The number of vertices in a full binary tree is _______.
25. If a relation is reflexive, then all the diagonal entries in the relation matrix must be________.