Power set of empty set has exactly _____ subset.

Related MCQs

• If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.
• The Subset relation on a set of sets is ________.
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                
• Every finite subset of a lattice has ____________.
• Two sets are called disjoint if there _____________ is the empty set.
• A non empty set A is termed as an algebraic structure                  
• A finite non-empty set of symbols is called _________.
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
• Each column of an incidence matrix of a graph G has exactly _______.