Q.1
Every block with at least three vertices are __________connected.
  • 1
  • 2
  • 3
  • 4
Q.2
A connected graph that has no cut vertices is called a ________.
  • block
  • bond
  • cycle
  • tour
Q.3
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
Q.4
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
Q.5
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)}
Q.6
The binary relation R = {(0), (a)} on A = {} is _______.
  • reflexive, not symmetric, transitive
  • not reflexive, symmetric, transitive
  • reflexive, symmetric, not transitive
  • reflexive, not symmetric, not transitive
Q.7
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
Q.8
The binary relation R = {(0), (a)} on A = {} is _______.
  • reflexive, not symmetric, transitive
  • not reflexive, symmetric, transitive
  • reflexive, symmetric, not transitive
  • reflexive, not symmetric, not transitive
Q.9
A graph is Eulerian if it contains __________.
  • Euler tour
  • Euler trail
  • Hamiltonian path
  • Euler path
Q.10
Hamilton cycle is a cycle that contains every ________of G.
  • path
  • cycle
  • vertex
  • edge
0 h : 0 m : 1 s