A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total orders on the set S which contain the partial order ≤ is              

Related MCQs

• If the longest chain in a partial order is of length l, then the partial order can be written as            disjoint antichains.
• The inclusion of              sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment.
• 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
• 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?
• If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set
• Let a relation R in the set R of real numbers be defined as (a, b) Î R if and only if 1 + ab > 0 for all a, bÎR. The relation R is
• A              is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
• 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                
• The set difference of the set A with null set is ________.