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.

 31. The average case occurs in the Linear Search Algorithm when : a. The item to be searched is in some where middle of the Array b. The item to be searched is not in the array c. The item to be searched is in the last of the array d. The item to be searclred is either in the last or not in the array

 32. To determine the efficiency of an algorithm the time factor is measured by a. Counting micro seconds b. Counting number of key operations c. Counting number of statement d. Counting kilobytes of algorithm

 33. Which of the following algorithms sort n integers, having the range 0 to (n^2 - 1), in ascending order in O(n) time ? a. Selection sort b. Bubble sort c. Radix sort d. Insertion sort

 34. Which of the following is asymptotically smaller? a. lg(lg*n) b. lg*(lgn) c. lg(n!) d. lg*(n!)

 35. Code blocks allow many algorithms to be implemented with the following parameters: a. clarity, elegance, performance b. clarity, elegance, efficiency c. elegance, performance, execution d. execution, clarity, performance

 36. Consider f(N) = g(N) + h(N)  Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? a. A* algorithm b. AO* algorithm c. Greedy best first search algorithm d. Iterative A* algorithm

 37. The reverse polish notation equivalent to the infix expression ((A + B) * C+ D)/(E + F + G) a. AB + C * D + EF + G + / b. AB + CD * + EF + G +/ c. AB + C * D + EFG + +/ d. AB + C * D + E + FG +/