You do not have access to this content.
In order to access the 'Quiz Zone' and all of its contents, please purchase a 'Premium Course'.
Quiz Summary
0 of 10 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
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 10 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
 Problem Solving / Algorithms 0%

Well done! It’s over! Now review your answers and continue working on your knowledge of any areas where you made a mistake.
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 Answered
 Review

Question 1 of 10
1. Question
Which statement below best describes a Linear Search carried out on a sorted array?
CorrectIncorrect 
Question 2 of 10
2. Question
Which statement below best describes a Binary Search being carried out on a sorted array?
CorrectIncorrect 
Question 3 of 10
3. Question
Consider the array: arr=[4,6,7,11,10,12,15].
Why will a binary search fail to find the number 10?CorrectIncorrect 
Question 4 of 10
4. Question
Consider the data set "cat", "dog", "gerbil", "hamster", "rabbit". How many steps will be required to find the item "rabbit", when using a 'linear search' algorithm? (if any noninteger values are calculated as part of the algorithm, the value will be rounded up to the nearest integer).
CorrectIncorrect 
Question 5 of 10
5. Question
Consider the data set "cat", "dog", "gerbil", "hamster", "rabbit". How many steps will be required to find the item "rabbit", when using a 'binary search' algorithm? (if any noninteger values are calculated as part of the algorithm, the value will be rounded up to the nearest integer).
CorrectIncorrect 
Question 6 of 10
6. Question
Which search algorithm is considered more efficient?
CorrectIncorrect 
Question 7 of 10
7. Question
Which search algorithm uses the principles of 'Divide and Conquer'?
CorrectIncorrect 
Question 8 of 10
8. Question
Which search algorithm is arguably far easier to program?
CorrectIncorrect 
Question 9 of 10
9. Question
Which type of search is described in this algorithm?
CorrectIncorrect 
Question 10 of 10
10. Question
Which type of search is described in this algorithm?
CorrectIncorrect