Q.1.
Order of the power set of a set of order n is
Q.2.
What is the minimum height for a binary search tree withnodes?
Q.3.
A____________has a greatest element and a least element which satisfy 0
Q.4.
(b.c) = (a.b).c is the representation for which property?
Q.5.
The______________of all the variables in direct or complemented from is a maxterm.
Q.6.
Which of the following traversal techniques lists the nodes of binary search in ascendingorder?
Q.7.
The negation of the statement is formed by introducing ___________.
Q.8.
The negation of the statement is formed by introducing ___________.
Q.9.
The statements formed from atomic statements are called _________statements.
Q.10.
The statements that we consider initially are simple statements called_________statements.
Q.11.
Each loop counting has _________ edges.
Q.12.
If the vertices of a walk W are distinct then W is called __________.
Q.13.
If the edges of a walk W are distinct then W is called _________.
Q.14.
The degree of vertex v in G is __________.
Q.15.
If the graph G1 and G2 has no vertex in common then it is said to be ______.
Q.16.
If H is a sub graph of G then G is a ______ of H.
Q.17.
To any graph G there corresponds a vertex in a matrix called ________matrix.
Q.18.
The graph defined by the vertices and edges of a __________ is bipartite.
Q.19.
Each edge has one end in set X and one end in set Y then the graph (X, Y) is called_____graph.
Q.20.
If two edges have same vertices as its terminal vertices those edges are called ____.