An Algorithm
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:
Question 1 options:







The worst case occurs in linear search algorithm when
Question 2 options:







How would you define a good algorithm?
Question 3 options:









In ________ search each element is compared with x till found or till all elements have been compared.
Question 4 options:







Suppose you are doing a sequential (linear) search of the ordered list [2, 5, 7, 8, 10, 13, 14, 16, 19, 20]. How many comparisons would you need to do in order to find the key 13?
Question 5 options:







To sort a list with n elements, the insertion sort begins with the __________ element.
Question 6 options:







A binary search algorithm begins at the _____ of a list.
Question 7 options:









The operation of processing each element in the list is known as
Question 8 options:







An algorithm is a _________ set of precise instructions for performing computation.
Question 9 options:







Suppose you have the following list of numbers to sort: [19, 1, 9, 7, 3, 10, 13, 15, 8, 12]. Which list represents the partially sorted list after three complete passes of bubble sort?
Question 10 options:







Submit Quiz0 of 10 questions saved
Bottom of Form