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

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

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

Q. An algorithm may have __________‘inputs’ quantities.

View solution

Q. ___________ refers to a finite set of steps, which, when followed, solves a particular problem.

View solution

Q. The two main resources that we consider for an algorithm are__________.

View solution

Q. Space complexity of an algorithm is the maximum amount of _______ required by it during execution.

View solution

Q. Frequently, the memory space required by an algorithm is a multiple of the size of input. State if the statement is True or False or Maybe.

View solution

Q. For many problems such as sorting, there are many choices of algorithms to use, some of which are extremely___________.

View solution

Q. In the analysis of algorithms, what plays an important role?

View solution

Q. An algorithm performs lesser number of operations when the size of input is small, but performs more operations when the size of input gets larger. State if the statement is True or False or Maybe.

View solution

Q. To verify whether a function grows faster or slower than the other function, we have some asymptotic or mathematical notations, which is_________.

View solution