Q.1
Order of the power set of a set of order n is
  • nnn
  • 2n2n2n
  • n2n^2n2
  • 2n2^n2n
Q.2
What is the minimum height for a binary search tree withnodes?
  • 1
  • 3
  • 4
  • 2
Q.3
A____________has a greatest element and a least element which satisfy 0
  • semilattice
  • join semilattice
  • meet semilattice
  • bounded lattice
Q.4
(b.c) = (a.b).c is the representation for which property?
  • g-ii
  • g-iii
  • r-ii
  • r-iii
Q.5
The______________of all the variables in direct or complemented from is a maxterm.
  • addition
  • product
  • moduler
  • subtraction
Q.6
Which of the following traversal techniques lists the nodes of binary search in ascendingorder?
  • pre order
  • post order
  • in order
  • root order
Q.7
The negation of the statement is formed by introducing ___________.
  • not
  • and
  • or
  • if
Q.8
The negation of the statement is formed by introducing ___________.
  • not
  • and
  • or
  • if
Q.9
The statements formed from atomic statements are called _________statements.
  • molecular
  • compound
  • atomic
  • simple
Q.10
The statements that we consider initially are simple statements called_________statements.
  • molecular
  • compound
  • atomic
  • simple
Q.11
Each loop counting has _________ edges.
  • 1
  • 2
  • 3
  • 4
Q.12
If the vertices of a walk W are distinct then W is called __________.
  • path
  • trial
  • walk
  • tour
Q.13
If the edges of a walk W are distinct then W is called _________.
  • path
  • trial
  • walk
  • tour
Q.14
The degree of vertex v in G is __________.
  • number of edges of G incident with v
  • number of loops in G
  • number of links in G
  • number of sub graph in G
Q.15
If the graph G1 and G2 has no vertex in common then it is said to be ______.
  • disjoint
  • edge disjoint
  • union
  • intersection
Q.16
If H is a sub graph of G then G is a ______ of H.
  • proper sub grapth
  • inducted sub graph
  • spanning subgraph
  • super graph
Q.17
To any graph G there corresponds a vertex in a matrix called ________matrix.
  • incidence
  • adjacency
  • square
  • null
Q.18
The graph defined by the vertices and edges of a __________ is bipartite.
  • square
  • cube
  • single
  • both square and cube
Q.19
Each edge has one end in set X and one end in set Y then the graph (X, Y) is called_____graph.
  • bipartite
  • simple
  • complete
  • trivial
Q.20
If two edges have same vertices as its terminal vertices those edges are called ____.
  • parallel
  • adjacent
  • incident
  • distinct
0 h : 0 m : 1 s