A9 - SEARCHING
Authored by Cham Cham ジ
Specialty
University
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
43 questions
Show all answers
1.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
(a) is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.
2.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step is set i to 1
(a)
3.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step seeks if i > n then go to step 7
(a)
4.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step seeks if A[i] = x then go to step 6
(a)
5.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step is set i to i + 1
(a)
6.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step goes back to Step 2
(a)
7.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
Step in Linear Search. This step prints Element x Found at index i and go to step 8
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
