Q. Which of the following is an example of dynamic programming approach?

View solution

Q. Which of the following uses memoization?

View solution

Q. Which of the following asymptotic notation is the worst among all?

View solution

Q. Minimum number of moves required to solve a Tower of Hanoi puzzle is

View solution

Q. Program with highest run-time complexity is

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The complexity of linear search algorithm is

View solution

Q. The complexity of Binary search algorithm is

View solution

Q. The complexity of Bubble sort algorithm is

View solution

Q. The complexity of merge sort algorithm is

View solution

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________.

View solution

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

View solution

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

View solution

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

View solution

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

View solution