Cardinality of a set is number of element of the set.

Related MCQs

• Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is
• The number of functions from an m element set to an n element set is:
• How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?
• Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….
• Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….
• If A be a finite set of size n, then number of elements in the power set of A x A is
• Define a binary relation R on a set A to be anti- reflexive if xRx doesn’t hold for any x 2 A. The number of symmetric, anti-reflexive binary relations on a set of ten elements is
• If S is a set containing n elements then number of elements in power set of S ,i.e.P(S)    
• If set A contains n elements, set B contains m elements then number of elements in AXB is---
• If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.