On This Page

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on Discrete Mathematics Set 17

Q1 | Boolean expression except 0 expressed in an equivalent form is called _____.
  • canonical
  • sum
  • product
  • standard
Q2 | _________relations are useful in solving certain minimization problems of switchingtheory.
  • Void
  • Universal
  • Compatibility
  • Equivalence
Q3 | The number of elements in a square matrix of order n is _____.
  • n power 3
  • n power 4
  • n power 5
  • n power 2
Q4 | Every non-trivial tree has at least _____ vertices of degree one.
  • 1
  • 2
  • 3
  • 4
Q5 | A ____ is an edge e such that w(G-e)>w(G).
  • cut vertex of G
  • cut edge of G
  • ends of G
  • path of G
Q6 | Every connected graph contains a ________.
  • tree
  • sub tree
  • spanning tree
  • spanning subtree
Q7 | A minimal non-empty edge cut of G is called a _________.
  • bond
  • cycle
  • path
  • tour
Q8 | A connected graph that has no cut vertices is called a ________.
  • block
  • bond
  • cycle
  • tour
Q9 | Every block with at least three vertices are __________connected.
  • 1
  • 2
  • 3
  • 4
Q10 | A graph is Eulerian if it contains __________.
  • Euler tour
  • Euler trail
  • Hamiltonian path
  • Euler path
Q11 | Hamilton cycle is a cycle that contains every ________of G.
  • path
  • cycle
  • vertex
  • edge
Q12 | Collection of human beings with 4 heads, 2 legs and two hands is a ________.
  • null set
  • finite set
  • infinite set
  • equal set
Q13 | A set containing no element is called ____________.
  • null set
  • finite set
  • infinite set
  • equal set
Q14 | A = {1,3,5,7,9} is a __________.
  • null set
  • finite set
  • singleton set
  • infinite set
Q15 | The number of Indians in the world is _________.
  • finite set
  • universal set
  • infinite set
  • equal set
Q16 | If in the truth table the answer column has the truth values both TRUE and FALSE then itis said to be ________.
  • tautology
  • contradiction
  • contingency
  • equivalence relation
Q17 | To prove the statement P tautologically implies the statement Q, it is enough to prove that_________.
  • P conditional Q is a contradiction
  • P conditional Q is a tautology
  • P biconditional is a contradiction
  • P biconditional Q is a tautology
Q18 | To prove the statement P is tautologically equivalent to the statement Q, it is enough toprove that _______.
  • P conditional Q is a contradiction
  • P conditional Q is a tautology
  • P biconditional Q is a contradiction
  • P biconditional Q is a tautology
Q19 | Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____.
  • {(1,5),(3,3),(2,6)}
  • {(1,5),(3,6),(2,5)}
  • {(4,4),(2,5),(3,3)}
  • {(1,1),(3,3),(2,2)}
Q20 | The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______.
  • reflexive, not symmetric, transitive
  • not reflexive, symmetric, transitive
  • reflexive, symmetric, not transitive
  • reflexive, not symmetric, not transitive
Q21 | There are only five distinct Hasse diagrams for partially ordered sets that contain_______elements.
  • 2
  • 3
  • 4
  • 6
Q22 | The production S tends to aB is of the type ________grammar.
  • 0
  • 1
  • 2
  • all the above
Q23 | The production S tends to A is of the type _____grammar.
  • 0
  • 1
  • 2
  • all the above
Q24 | A regular grammar contain rules of the form is _____.
  • A tends to AB
  • AB tends to a
  • A tends to aB
  • AB tends to CD
Q25 | If an edge e is said to join the vertices u and v then the vertices u and v are called __.
  • initial vertices
  • terminal vertices
  • ends of e
  • all the above