111. A relation that can be used to partition a set into equivalence classes is called
a. Symmetric
b. Asymmetric
c. Equivalence
d. Non-equivalence
Answer: (c).Equivalence

112. If a binary relation is antisymmetric and transitive is referred to as
a. Impartial order
b. Partial order
c. Comparable order
d. Non-comparable order
Answer: (b).Partial order

113. A sequence is also referred to as a
a. Tuple
b. Instsance
c. Domain
d. Attribute
Answer: (a).Tuple

114. Duplicate-valued elements can be attributed in a
a. Set
b. Entities
c. Sequence
d. Structure
Answer: (c).Sequence

115. Each member of a set can be thought of an/a
a. Primitive element of type
b. Set itself
c. Both a and b
d. Data element of set
Answer: (c).Both a and b

116. A collection of elements having an specific order is called
a. Program
b. Sequence
c. Structure
d. Relation
Answer: (b).Sequence

117. Total order is also called
a. Uniform order
b. Static order
c. Linear order
d. Paired order
Answer: (c).Linear order

118. If every pair of distinct elements in a partial order are comparable, then order is called a
a. Total order
b. Partial order
c. Non-comparable order
d. Comparable order
Answer: (a).Total order

119. Members of a set are drawn from a larger population known as
a. Data type
b. Primitive type
c. Compound type
d. Base type
Answer: (d).Base type

120. Set on which partial order is defined is called
a. Poset
b. Relation
c. Sequence
d. Coset
Answer: (a).Poset