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

Q. Which of the following is not a Characteristics of a Data Structure?

View solution

Q. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?

View solution

Q. Data items that cannot be divided are called as?

View solution

Q. Which of the following analysis known as theoretical analysis of an algorithm?

View solution

Q. Which of the following analysis known as empirical analysis of an algorithm?

View solution

Q. O(1) means computing time is __________________

View solution

Q. The time factor when determining the efficiency of algorithm is measured by?

View solution

Q. In an array representation of binary tree the right child of root will be at location of?

View solution