Computational Complexity Theory

Q1. What is the complexity of merge sort algorithm is?

O(log n)

O(n log n)

O(n)

O(n2)

Q2. What is the complexity of bubble sort algorithm is?

O(n log n)

O(n)

O(n2)

O(log n)

Q3. From which of these the best behaviour is shown?

Merge Sort

Insertion Sort

Quick Sort

Heap Sort

Q4. What is the complexity of binary search algorithm is?

O(n)

O(n2)

O(log)

O(n log n)

Q5. If you are asked to sort 15 randomly generated numbers,what would you prefer?

Selection sort

Quick sort

Insertion sort

Bubble sort

Q6. What is the complexity of fibonacci series?

O(log n)

O(2n)

O(n log n)

O(n2)

Q7. What is the worst case complexity of quick sort?

O(log n)

O(n)

O(n2)

O(n log n)

Q8. The worst case occurs in quick sort when pivot is the smallest element.

FALSE

TRUE

Q9. In the following cases, which of these does not exist in complexity theory?

Worst case

Best case

Null case

Average case

Q10. What is the complexity of linear search algorithm is?

O(n2)

O(n log n)

O(n)

O(log n)

Your Score

- of - questions are answered correctly

For Support

Office Hours

We are on

Company

Customer Service

Help

Your Score

- of - questions are answered correctly

Login to view answer sheet

FORGOT PASSWORD

SIGN UP

Email Verification

For Support

Office Hours

We are on

Company

Customer Service

Help