adplus-dvertising
frame-decoration

Question

Program with highest run-time complexity is

a.

Tower of Hanoi

b.

Fibonacci Series

c.

Prime Number Series

d.

None of the above

Answer: (a).Tower of Hanoi

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Program with highest run-time complexity is

Similar Questions

Discover Related MCQs

Q. The time complexity of quick sort is …………..

Q. Two main measures for the efficiency of an algorithm are

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

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

Q. Which of the following case does not exist in complexity theory

Q. The complexity of the average case of an algorithm is

Q. The complexity of linear search algorithm is

Q. The complexity of Binary search algorithm is

Q. The complexity of Bubble sort algorithm is

Q. The complexity of merge sort algorithm is

Q. Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.

Q. The complexity of multiplying two matrices of order m*n and n*p is

Q. Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time.

Q. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

Q. Ackerman’s function is defined on the non-negative integers as follows
a (m,n) = n+1 if m=0
= a (m-1, 1) if m ≠ 0, n=0
= a (m-1, a(m, n-1)) if m ≠ 0, n ≠ 0
The value of a (1, 3) is

Q. What is a set of steps for carrying out a specific task called?

Q. A real world example of an algorithm would be a___________.

Q. Who should know about the basic algorithmic toolbox structures that allow efficient organization and retrieval of data frequently used algorithms and basic techniques for modeling, understanding and solving algorithmic problems?

Q. Algorithms are at the heart of every non-trivial computer application and also a modern and active area of ____________.

Q. Operations performed on scalar quantities are termed simple, while operations on vector data normally termed as_______.