Q. An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________

View solution

Q. An algorithm which uses the past results and uses them to find the new results is _________

View solution

Q. A Complexity of algorithm depends upon _________

View solution

Q. An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________

View solution

Q. For a recursive algorithm _________

View solution

Q. Optimization of algorithm means _________

View solution

Q. For an algorithm which is the most important characteristic that makes it acceptable _________

View solution

Q. An algorithm can be represented through _________

View solution

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