Basics of time complexity quiz 1

Q1.Which of these are not correct?

• Merge Sort is inplace sorting algorithm.

• Merge sort takes an extra space only.

• Merge Sort is Stable Sort.

• Merge Sort is unstable sort.

Q2. Which of these are correct?

• Heap Sort is Stable Sort

• Heap Sort is unplaced Sort

• Heap Sort is unstable Sort

• Heap Sort is inplaced sort

Q4. If f(n) = O(g(n)) and g(n)=O(h(n))

Then f(n)=O(h(n))

• A. TRUE

• B. FALSE

Q4.

Suppose The input data set

5,4,3*,5*,3

• Stable sort: 3*,3,5,5*,4

• Stable sort: 3*,3,4,5,5*

• Unstable sort : 3,3*,4,5,5*

• Stable sort: 3*,3,4,5*,5

f(n)= 3(n*n)+4n+5

• f(n)= Theta(n^3)

• f(n)=Theta (n^2)

• f(n)=o(n^2)

• f(n)= O(n^2)

• f(n)=Big omega(n^2)

f(n)=100001(n^2) + 6568654366n + 1000000000909

Find the correct one

• f(n) =O(n^3)

• f(n)= O(n^2)

• O(n^2) is more approximate than O(n^3)

• f(n) = o(n^2)