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

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