Searching techniques in C

1. Finding an element, whether that is present in a list or not. It is called__

2. In the following type of searching key-comparisons are needed

3. Binary search is ____ type of search

4. Binary search tree is a ___ type of search

5. Searching techniques are classified in to__ types

6. The element that is going to be searched in a list is called ___

7. If a key is found in a list that is called ___ type of search

8. The following type of search is easy to implement.

9. In linear search with array, how many comparisons are needed in best case?

10. Match the following

11. In ___type of search the list is divided in to two parts.

12. Binary search algorithm cannot be applied to__

13. Binary search can be applied on the sorted __________.

14. Binary search is useful when there are large number of_______in array.

15. In binary search, we compare the value with the elements in the __________ position of the array.

16. Which of the following is not the required condition for binary search algorithm?

17. Finding the location of the element with a given value is ___.

18. Non linear searching techniques are classified in to __ categories

19. Which of the following searching techniques do not require the data to be in sorted form

20. In ……………, search start at the beginning of the list and check every element in the list.