Q. There are two algorithms suppose A takes 1.41 milli seconds while B takes 0.9 milliseconds, which one of them is better considering all other things the same?

View solution

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

View solution

Q. The complexity of linear search algorithm is _________

View solution

Q. The complexity of Binary search algorithm is _________

View solution

Q. The complexity of merge sort algorithm is _________

View solution

Q. The Worst case occur in linear search algorithm when _________

View solution

Q. The worst case complexity for insertion sort is _________

View solution

Q. The complexity of Fibonacci series is _________

View solution

Q. The worst case occurs in quick sort when _________

View solution

Q. The worst case complexity of quick sort is _________

View solution

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

View solution

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

View solution

Q. If for an algorithm time complexity is given by O(log₂n) then complexity will be ___________

View solution

Q. If for an algorithm time complexity is given by O(n) then the complexity of it is ___________

View solution

Q. If for an algorithm time complexity is given by O(n²) then complexity will ___________

View solution

Q. If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________

View solution

Q. The time complexity of binary search is given by ___________

View solution

Q. The time complexity of the linear search is given by ___________

View solution

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

View solution

Q. Time complexity of the binary search algorithm is constant.

View solution