A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

#### Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

 51. 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. a. False b. True c. Maybe d. None of the above

 52. 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 _____________. a. Rigorously specified b. Clearly specified c. Both (a) and (b) d. None of the above

 53. In general, a problem may be defined as a state of thing that is not in the___________. a. Wrong order b. Opposite order c. Right order d. None of the above

 54. An algorithm that requires ................... operations to complete its task on n data elements is said to have a linear runtime. a. n^3 + 9 b. 3n^2 + 3n + 2 c. 2n + 1 d. 9

 55. The complexity of adding two matrices of order m*n is a. m + n b. mn c. max(m, n) d. min(m, n)

 56. lg (n!) = ................. a. O(n) b. O(lg n) c. O(n^2) d. O(n lg n)

 57. Which of the following uses memorization? a. Greedy approach b. Divide and conquer approach c. Dynamic programming approach d. None of the above