Discrete Mathematics - Questions & Answers for Competitive Exams | GkSeries

37. A product of the variable and their negation in a formula is called ________.

• [A] an elementary sum
• [B] an elementary product
• [C] a well-formed formula
• [D] an equivalence of relation formula

Answer: Option [B]

38. A formula consisting of disjunctions of min-terms is called _________.

• [A] DNF
• [B] CNF
• [C] PDNF
• [D] PCNF

Answer: Option [C]

39. A relation R in X is said to be a ________, if it is reflexive and symmetric.

• [A] void relation
• [B] circular
• [C] partial order relation
• [D] compatibility relation

Answer: Option [D]

40. A self complemented distributive lattice is called _______.

• [A] boolean algebra
• [B] modular lattice
• [C] complete lattice
• [D] self dual lattice

Answer: Option [A]

41. A formula consisting of conjunctions of max-terms is called _________

• [A] DNF
• [B] CNF
• [C] PCNF
• [D] PDNF

Answer: Option [C]

42. Which of the following is Absorption Law?

• [A] a*a <=>a
• [B] a+(a*b)<=> a
• [C] a*b <=>a*a
• [D] (a*b)*c <=>a*(b*c)

Answer: Option [B]

43. If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.

• [A] complete
• [B] associative
• [C] absorption
• [D] commutative

Answer: Option [A]

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

• [A] canonical
• [B] sum
• [C] product
• [D] standard

Answer: Option [A]

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

• [A] n power 3
• [B] n power 4
• [C] n power 5
• [D] n power 2

Answer: Option [D]

46. Every connected graph contains a ________.

• [A] tree
• [B] sub tree
• [C] spanning tree
• [D] spanning subtree

Answer: Option [C]

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

• [A] block
• [B] bond
• [C] cycle
• [D] tour

Answer: Option [A]

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

• [A] 1
• [B] 2
• [C] 3
• [D] 4

Answer: Option [B]