UNIT-6 Searching And Sorting Techniques Q.1 The __________ refers to the operation of arranging data in some given order, such as increasing or decreasing. (a) sorting (b) searching (c) merging Q.2 Which sorting technique needs to scan through the entire array and swap adjacent elements whenever required? (a) Bubble Sort (b) Selection Sort (c) Insertion Sort Q.3 The number of moves required for sorting an array using the Bubble Sort is (a) O (n2) (b) O (Log (n) (c) O (n) Q.4 The technique which involves selecting the minimum element is (a) Bubble Sort (b) Selection Sort (c) Insertion Sort Q.5 The number of moves required for sorting an array using the Selection Sort is (a) O (n) (b) O (Log (n) (c) O (n2) Q.6 __________sort works by considering the elements one at a time and inserting the element in its proper place among those already considered. (a) Bubble Sort (b) Selection Sort (c) Insertion Sort Q.7 Factors that help in deciding the sorting algorithm to be used are (a) Memory (b) Performance (c) Flexibility (d) All Q.8 Which Sorting technique is simplest to use? (a) Bubble Sort (b) Selection Sort (c) Insertion Sort (d) Quick Sort Q.9 Which searching technique is the best among the three searching techniques? (a) Quick Search (b) Binary Search (c) Linear Search Q.10.In __________search, as the number of elements increases, the time taken to perform the search increases linearly. (a) Quick Search (b) Binary Search (c) Linear Search Q.11 The linear search requires __________comparisons in the worst case. (a) N (b) N*N (c) log (N)
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.