adplus-dvertising
frame-decoration

Question

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

a.

(n)

b.

f(m)

c.

mf(n)

d.

nf(m)

Answer: (c).mf(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. What is true about Interface in data structure?

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

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

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

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

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

Q. O(1) means computing time is __________________

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

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

Q. The upper bound on the time complexity of the nondeterministic sorting algorithm is?

Q. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________.

Q. What is the type of the algorithm used in solving the 8 Queens problem?

Q. Which of the following belongs to the algorithm paradigm?

Q. The [] notation is

Q. _______ is the process of encoding information using fewer bits than the original representation.

Q. How many types of compression there?

Q. Which compression loses data?

Q. Which of the following is Lossless Data Compression Algorithms?

Q. Lossy compression reduces bits by removing unnecessary or less important information.