Q. In ________ search each element is compared with x till not found.

View solution

Q. If the entire list is searched sequentially without locating x in linear search, the solution is __________

View solution

Q. To sort a list with n elements, the insertion sort begins with the __________ element.

View solution

Q. __________ comparisons required to sort the list 1, 2, 3…….n using insertion sort.

View solution

Q. The Worst case occurs in linear search algorithm when ____________

View solution

Q. List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is ___________

View solution

Q. The operation of processing each element in the list is known as _________

View solution

Q. The complexity of Bubble sort algorithm is _________

View solution

Q. An Algorithm is ___________

View solution

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