Quiznetik

Discrete Mathematics | Set 5

1. Boolean expression except 0 expressed in an equivalent form is called _____.

Correct : A. canonical

2. _________relations are useful in solving certain minimization problems of switching theory.

Correct : C. Compatibility

3. The number of elements in a square matrix of order n is _____.

Correct : D. n power 2

4. Every non-trivial tree has at least _____ vertices of degree one.

Correct : B. 2

5. A ____ is an edge e such that w(G-e)>w(G).

Correct : B. cut edge of G

6. Every connected graph contains a ________.

Correct : C. spanning tree

7. A minimal non-empty edge cut of G is called a _________.

Correct : A. bond

8. A connected graph that has no cut vertices is called a ________.

Correct : A. block

9. Every block with at least three vertices are __________connected.

Correct : B. 2

10. A graph is Eulerian if it contains __________.

Correct : A. Euler tour

11. Hamilton cycle is a cycle that contains every ________of G.

Correct : C. vertex

12. Collection of human beings with 4 heads, 2 legs and two hands is a ________.

Correct : A. null set

13. A set containing no element is called ____________.

Correct : A. null set

14. A = {1,3,5,7,9} is a __________.

Correct : B. finite set

15. The number of Indians in the world is _________.

Correct : A. finite set

16. If in the truth table the answer column has the truth values both TRUE and FALSE then it is said to be ________.

Correct : C. contingency

17. To prove the statement P tautologically implies the statement Q, it is enough to prove that _________.

Correct : B. P conditional Q is a tautology

18. To prove the statement P is tautologically equivalent to the statement Q, it is enough to prove that _______.

Correct : D. P biconditional Q is a tautology

19. Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____.

Correct : A. {(1,5),(3,3),(2,6)}

20. The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______.

Correct : B. not reflexive, symmetric, transitive

21. There are only five distinct Hasse diagrams for partially ordered sets that contain _______elements.

Correct : B. 3

22. The production S tends to aB is of the type ________grammar.

Correct : D. all the above

23. The production S tends to A is of the type _____grammar.

Correct : A. 0

24. A regular grammar contain rules of the form is _____.

Correct : C. A tends to aB

25. If an edge e is said to join the vertices u and v then the vertices u and v are called __.

Correct : B. terminal vertices

26. Edges intersect only at their ends are called ________.

Correct : A. planar

27. Two vertices which are incident with the common edge are called ______________vertices.

Correct : C. adjacent

28. An edge with identical ends is called _________.

Correct : C. loops

29. An edge with same ends is called ___________.

Correct : D. link

30. In a graph if few edges have directions and few do not have directions then the graph is called _________.

Correct : D. mixed graph

31. If two edges have same vertices as its terminal vertices those edges are called ____.

Correct : A. parallel

32. Each edge has one end in set X and one end in set Y then the graph (X, Y) is called _____graph.

Correct : A. bipartite

33. The graph defined by the vertices and edges of a __________ is bipartite.

Correct : B. cube

34. To any graph G there corresponds a vertex in a matrix called ________matrix.

Correct : A. incidence

35. If H is a sub graph of G then G is a ______ of H.

Correct : D. super graph

36. If the graph G1 and G2 has no vertex in common then it is said to be ______.

Correct : A. disjoint

37. The degree of vertex v in G is __________.

Correct : A. number of edges of G incident with v

38. If the edges of a walk W are distinct then W is called _________.

Correct : D. tour

39. If the vertices of a walk W are distinct then W is called __________.

Correct : A. path

40. Each loop counting has _________ edges.

Correct : B. 2

41. The statements that we consider initially are simple statements called _________statements.

Correct : C. atomic

42. The statements formed from atomic statements are called _________statements.

Correct : A. molecular

43. The negation of the statement is formed by introducing ___________.

Correct : A. not