There are only five distinct Hasse diagrams for partially ordered sets that contain _______elements.

Related MCQs

• If a, b, c, d and e are five natural numbers, then find the number of ordered sets(a, b, c, d, e) possible such that a+b+c+d+e=75.
• If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
• 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                        
• If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
• The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is ____________.
• For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?
• Two finite sets A and B have m and n elements respectively. If the total number of subsets of A is 112 more than the total number of subsets of B, then the value of m is
• An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if
• Two sets are called disjoint if there _____________ is the empty set.
• A _______ is an ordered collection of objects.