Design n Analysis of Algorithm

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

• Average Case

• Null Case

• Best Case

• Worst Case

The complexity of linear search algorithm is

• O(n)

• O(log n)

• O(n²)

• O(n log n)

The complexity of Binary search algorithm is _________

• O(n)

• O(log)

• O(n2)

• O(n log n)

The complexity of merge sort algorithm is _________

• O(n)

• O(log n)

• O(n2)

• O(n log n)

The worst case complexity for insertion sort is _________

• O(n)

• O(log n)

• O(n2)

• O(n log n)

Which is used to measure the Time complexity of an algorithm Big O notation?

• describes limiting behaviour of the function

• characterises a function based on growth of function

• upper bound on growth rate of the function

• all of the mentioned

If for an algorithm time complexity is given by O(1) then the complexity of it is ____________

• constant

• polynomial

• exponential

• none of the mentioned

.Recursion is similar to which of the following?

• Switch Case

• Loop

• If-else

• If-else-if

In recursion, the condition for which the function will stop calling itself is ____________

• Best Case

• Worst Case

• Base Case

• There is no such case

Heap sort is an implementation of ____________ using a descending priority queue.

• Selection Sort

• Insertion Sort

• Merge Sort

• Bubble Sort