adplus-dvertising
frame-decoration

Question

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

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If a binary relation is antisymmetric and transitive is referred to as

Similar Questions

Discover Related MCQs

Q. A sequence is also referred to as a

Q. Duplicate-valued elements can be attributed in a

Q. Each member of a set can be thought of an/a

Q. A collection of elements having an specific order is called

Q. Total order is also called

Q. If every pair of distinct elements in a partial order are comparable, then order is called a

Q. Members of a set are drawn from a larger population known as

Q. Set on which partial order is defined is called

Q. Relation between two sets P and Q in qiven form is P ⊂ Q is

Q. A collection of distinguishable members or elements is known to be

Q. A set cannot have

Q. R is an equivalence relation on set S if it has property of

Q. Sum of reciprocals from 1 to n, called

Q. Relation defining a function by means of an expression that includes one or more instances of itself is known to be

Q. Factorial's definition contains a recursive part and

Q. Recurrence relations are widely used for modelling cost of

Q. Which of the following criterion is NOT written using the proper syntax?

Q. How many cases are there, which are used to compare various data structure's execution time in a relative manner?

Q. Which case of data structure operation takes maximum time?

Q. In Average case, if operation takes f(n) time in execution, then m operations will take?