Q. A function in which f(n) is Ω(g(n)), if there exist positive values k and c such that f(n)>=c*g(n), for all n>=k. This notation defines a lower bound for a function f(n):

View solution

Q. An algorithm that indicates the amount of temporary storage required for running the algorithm, i.e., the amount of memory needed by the algorithm to run to completion is termed as_____.

View solution

Q. The amount of time the computer needs to run to completion is known as_____.

View solution

Q. ___________algorithm is one which utilizes minimum processor time and requires minimum memory space during its execution.

View solution

Q. In simple terms, we can say that an algorithm is a step-by-step procedure for performing some task in a finite amount of time. State if the statement is true or false.

View solution

Q. Each operation must have a definite meaning and it must be perfectly clear. All steps of an algorithm need to be precisely defined. The actions to be executed in each case should be _____________.

View solution

Q. In general, a problem may be defined as a state of thing that is not in the___________.

View solution

Q. An algorithm that requires ................... operations to complete its task on n data elements is said to have a linear runtime.

View solution

Q. The complexity of adding two matrices of order m*n is

View solution

Q. lg (n!) = .................

View solution

Q. Which of the following uses memorization?

View solution

Q. An algorithm is made up of 2 modules M1&M2.; If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?

View solution

Q. An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

View solution

Q. The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is

View solution

Q. Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80, 120, 150 number of records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with the same frequency.

View solution

Q. An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is

View solution

Q. The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is

View solution

Q. The running time of an algorithm is given by T(n) = T(n - 1) + T(n - 2) - T(n - 3), if n > 3 n, otherwise.

View solution

Q. A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of

View solution

Q. The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is

View solution