Q. An algorithm must have

View solution

Q. Process of following a method to solve a problem is called a/an

View solution

Q. Inputs of a function can also be referred to

View solution

Q. A relation that can be used to partition a set into equivalence classes is called

View solution

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

View solution

Q. A sequence is also referred to as a

View solution

Q. Duplicate-valued elements can be attributed in a

View solution

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

View solution

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

View solution

Q. Total order is also called

View solution

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

View solution

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

View solution

Q. Set on which partial order is defined is called

View solution

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

View solution

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

View solution

Q. A set cannot have

View solution

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

View solution

Q. Sum of reciprocals from 1 to n, called

View solution

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

View solution

Q. Factorial's definition contains a recursive part and

View solution