Searching techniques in C
Quiz Summary
0 of 20 Questions completed
Questions:
Information
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
Results
Results
0 of 20 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
- Not categorized 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- Current
- Review
- Answered
- Correct
- Incorrect
- Question 1 of 20
1. Question
1. Finding an element, whether that is present in a list or not. It is called__
CorrectIncorrect - Question 2 of 20
2. Question
2. In the following type of searching key-comparisons are needed
CorrectIncorrect - Question 3 of 20
3. Question
3. Binary search is ____ type of search
CorrectIncorrect - Question 4 of 20
4. Question
4. Binary search tree is a ___ type of search
CorrectIncorrect - Question 5 of 20
5. Question
5. Searching techniques are classified in to__ types
CorrectIncorrect - Question 6 of 20
6. Question
6. The element that is going to be searched in a list is called ___
CorrectIncorrect - Question 7 of 20
7. Question
7. If a key is found in a list that is called ___ type of search
CorrectIncorrect - Question 8 of 20
8. Question
8. The following type of search is easy to implement.
CorrectIncorrect - Question 9 of 20
9. Question
9. In linear search with array, how many comparisons are needed in best case?
CorrectIncorrect - Question 10 of 20
10. Question
10. Match the following
Sort elements
- Linear search
- Sequential search
- Binary Tree Search
- Binary search
- Linked list search
- Tree Search
CorrectIncorrect - Question 11 of 20
11. Question
11. In ___type of search the list is divided in to two parts.
CorrectIncorrect - Question 12 of 20
12. Question
12. Binary search algorithm cannot be applied to__
CorrectIncorrect - Question 13 of 20
13. Question
13. Binary search can be applied on the sorted __________.
CorrectIncorrect - Question 14 of 20
14. Question
14. Binary search is useful when there are large number of_______in array.
CorrectIncorrect - Question 15 of 20
15. Question
15. In binary search, we compare the value with the elements in the __________ position of the array.
CorrectIncorrect - Question 16 of 20
16. Question
16. Which of the following is not the required condition for binary search algorithm?
CorrectIncorrect - Question 17 of 20
17. Question
17. Finding the location of the element with a given value is ___.
CorrectIncorrect - Question 18 of 20
18. Question
18. Non linear searching techniques are classified in to __ categories
CorrectIncorrect - Question 19 of 20
19. Question
19. Which of the following searching techniques do not require the data to be in sorted form
CorrectIncorrect - Question 20 of 20
20. Question
20. In ……………, search start at the beginning of the list and check every element in the list.
CorrectIncorrect