This section focuses on the "Complexity" of the Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

1. Which of the following case does not exist in complexity theory?

2.

What is the time, space complexity of following code:

int a = 0, b = 0;
for (i = 0; i < N; i++)
{
a = a + rand();
}
for (j = 0; j < M; j++)
{
b = b + rand();
}

3. The complexity of linear search algorithm is

4.

What is the time complexity of following code:

int a = 0;
for (i = 0; i < N; i++)
{
for (j = N; j > i; j--)
{
a = a + i + j;
}
}

5. The Worst case occur in linear search algorithm when

6.

What is the time complexity of following code:

int i, j, k = 0;
for (i = n / 2; i <= n; i++)
{
for (j = 2; j <= n; j = j * 2)
{
k = k + n / 2;
}
}

7. The worst case occur in quick sort when

8. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

9. The complexity of Fibonacci series is

10.

What is the time complexity of following code:

int a = 0, i = N;
while (i > 0)
{
a += i;
i /= 2;
}

11.

What is the time complexity of following code:

int a = 0, i = N;
while (i > 0)
{
a += i;
i /= 2;
}

12. The complexity of Binary search algorithm is

13. The complexity of merge sort algorithm is

14. The complexity of Bubble sort algorithm is

15. The worst case complexity for insertion sort is

16. The worst case complexity of quick sort is

17. To measure Time complexity of an algorithm Big O notation is used which:

18. If for an algorithm time complexity is given by O(1) then complexityof it is:

19. If for an algorithm time complexity is given by O(log2n) then complexity will:

20. If for an algorithm time complexity is given by O(n) then complexityof it is:

21. if for an algorithm time complexity is given by O(n2) then complexity will:

22. If for an algorithm time complexity is given by O((3/2)^n) then complexity will:

23. the time complexity of binary search is given by:

24. The time complexity of linear search is given by:

25. Which algorithm is better for sorting between bubble sort and quicksort?

26. State true or false
Time complexity of binary search algorithm is constant

27. Two main measures for the efficiency of an algorithm are

28. Which is the best data structure for round robin algorithm for CPU scheduling?

29. Which algorithm is having highest space complexity?

30. If the array is already sorted, then the running time for merge sort is: ?


 

Related Posts