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

Q. Recurrence relations are widely used for modelling cost of

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. __________ is a single elementary unit of information representing an attribute of an entity.

View solution

Q. What is true about Interface in data structure?

View solution