Question

Which of the following statements about sequential search is true? a. The list must be a sorted list. b. It works only on a list of integers. c. When the search target is not in the list, every element must be tested d. The search typically starts at the middle of the list and searches on either side of the middle. e. None of the above. Consider searching for a target value of 44 in the sorted list given below using binary search. 10 22 35 44 67 72 85 92 99 The first element to be compared to the target is a. 10 b. 99 c. 72 d. 67 e. 44 Consider searching for a target value of 75 in the sorted list given below using, binary search: 10 22 35 44 67 72 85 92 99 The last element to be compared to the target is: a. 10 b. 99 c. 72 d. 67 e. 44 What would be the contents of an array order after two passes of insertion sort, if the initial array contents are as shown below? 22 91 57 26 38 10 63 a. 10 22 57 26 38 91 63 b. 10 22 26 38 57 63 91 c. 22 38 57 10 26 63 91 d. 22 10 26 38 57 63 91 e. 22 57 91 26 38 10 63

Answer 1

23) Which of the following statement about sequential search is true?

Correct option: c. When the search target is not in the list, every element must be tested.

Explanation: Sequential search finds a target value in the given list. It starts its checking sequentially from the starting element of the list and checks each of the elements until a match is found or until all the elements of the list have been checked. For this method, list need not to be a sorted one. Sequential search is a method which is not specific to a particular data type. Hence it can work upon any list whether the elements are integer or float or double or string etc. So it is now clear that options a, b, d and e are incorrect. Option c is the correct one.

24) Target value 44. Given list: 10, 22, 35, 44, 67, 72, 85, 92, 99; Method of searching: Binary search; The first element to be compared to the target is:

Correct option: d. 67.

Explanation: Binary search method works upon a sorted list by repeatedly dividing the search interval in half. So for the first iteration the search interval would be the full list. The given list has 9 elements starting from index 1 through 9. So this method would divide the list into two half finding the middle index, here for 1^st iteration the middle index would be (1+9)/2 = 5. Now the target element would be compared with the value of the middle index. Hence the first element to be compared to the target is element in the 5^th index of the list; which is 67. So, options a, b, c and e are incorrect. Option d is the correct option.

25) Target value 75. Given list: 10, 22, 35, 44, 67, 72, 85, 92, 99; Method of searching: Binary search; The last element to be compared to the target is:

Correct option: c. 72.

Explanation: Binary search method works upon a sorted list by repeatedly dividing the search interval in half.

So for the 1^st iteration the search interval would be the full list. The given list has 9 elements starting from index 1 through 9. So this method would divide the list into two half finding the middle index, here for 1^st iteration the middle index would be (1+9)/2 = 5. Now the target element would be compared with the value at the index 5; which is 67.Now 67 is less than the target value 75 so the left half of the middle index is discarded; now the search interval has become only the right half of the middle index. At this point the element will be searched from index 6 through index 9.

For 2^nd iteration middle index would be (6+9)/2 = 7.5 i.e. 7. Now the target element would be compared with the value at the index 7; which is 85. Now 85 is greater than the target value 75 so the right half of the middle index is discarded; now the search interval has become only the left half of the middle index. At this point the element will be searched from index 6 through index 6.

For 3^rd iteration middle index would be (6+6)/2 = 6. Now the target element would be compared with the value at the index 6; which is 72. Now 72 is less than the target value 75 so the left half of the middle index should be discarded; but as the lower and higher index is same for this iteration so process would be stopped here (no elements are there to create the next search interval). Hence the last element to be compared to the target is: 72. So options a, b, d and e are incorrect. Correct option is c.

26) Initial array contents are: 22, 91, 57, 26, 38, 10, 63; method of sorting: Insertion sort; contents of array after 2 passes would be:

Correct option: e. 22, 57, 91, 26, 38, 10, 63.

Explanation: In this sorting method, in each pass an element is picked and inserted at the appropriate position in ascending or descending order. In pass 1: element at index 1 is inserted in a proper order so that 0^th and 1^st elements are sorted. In pass 2: element at index 2 is inserted in a proper order so that 0^th, 1^st and 2^nd elements are sorted. In this way n-1 passes are carried out to sort the whole array with n elements.

After 1^st pass the contents of the given array would be: 22, 91, 57, 26, 38, 10, 63.

After 2^nd pass the contents of the given array would be: 22, 57, 91, 26, 38, 10, 63.

Hence options a, b, c and d are incorrect. Correct option is e.

/*If this helps you, please let me know by giving a positive thumbs up. In case you have any queries, do let me know. I will revert back to you. Thank you!!*/