A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 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

 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

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

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

 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

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

 117. Total order is also called a. Uniform order b. Static order c. Linear order d. Paired order