Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

121) Which of the following sorting algorithms does not have a worst case running time of O(n2)

Answer is:

Merge sort

122) For a linear search in an array of n elements the time complexity for best, worst and average case are ......., ....... and ........ respectively

Answer is:

O(1),O(n) and O(n)

123) The average time required to perform a successful sequential search for an element in an arrayA(1 : n) is given by

Answer is:

(n + 1)/2

124) Using the standard algorithm, what is the time required to determine that a number n is prime

Answer is:

Linear time

125) The average time required to perform a successful sequential search for an element in an arrayA (1 : n) is given by

Answer is:

(n+1)/2

22
23
24
25
26
27
28