Algorithms4G – ReviseComputerScience

Skip to content

ReviseComputerScience

Free Resources
Student Dashboard
Teacher Dashboard
Legal
Login
Cart / £0.00
0

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'.

Time limit: 0

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

Quiz complete. Results are being recorded.

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?
- The last item is found and checked. If it is the searched for item then the search will stop. If not, the search will continue on the previous item. This is repeated until the entire array is read.
- The middle item is found and checked. If it is the searched for item then the search will stop. If not, the found item is compared with the searched for item. If the searched for item is smaller, the process is repeated in the first half of the array. If it is greater, the process is repeated in the second half of the array.
- The first item is found and checked. If it is the searched for item then the search will stop. If not, the search will continue on the next item. This is repeated until the entire array is read.
- The array is split into two halves. Each new array is split into two. This halving continues until all individual items are separated. Then, each item is read and compared to the searched for item until it is found.
Correct

Incorrect
Question 2 of 10

2. Question
Which statement below best describes a Binary Search being carried out on a sorted array?
- The last item is found and checked. If it is the searched for item then the search will stop. If not, the search will continue on the previous item. This is repeated until the entire array is read.
- The middle item is found and checked. If it is the searched for item then the search will stop. If not, the found item is compared with the searched for item. If the searched for item is smaller, the process is repeated in the first half of the array. If it is greater, the process is repeated in the second half of the array.
- The first item is found and checked. If it is the searched for item then the search will stop. If not, the search will continue on the next item. This is repeated until the entire array is read.
- The array is split into two halves. Each new array is split into two. This halving continues until all individual items are separated. Then, each item is read and compared to the searched for item until it is found.
Correct

Incorrect
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?
- ...because a binary search only works on non-integer data types.
- ...because the array is not correctly defined.
- ...because a disadvantage of a binary search is that it can fail to find numbers which are also in the binary number system (ie 10 is also a binary number which has the denary value of '2' in binary)
- ...because binary searches rely on data sets being ordered.
Correct

Incorrect
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 non-integer values are calculated as part of the algorithm, the value will be rounded up to the nearest integer).
- 1
- 2
- 3
- 4
- 5
- 6
Correct

Incorrect
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 non-integer values are calculated as part of the algorithm, the value will be rounded up to the nearest integer).
- 1
- 2
- 3
- 4
- 5
- 6
Correct

Incorrect
Question 6 of 10

6. Question
Which search algorithm is considered more efficient?
- Linear
- Binary
Correct

Incorrect
Question 7 of 10

7. Question
Which search algorithm uses the principles of 'Divide and Conquer'?
- Linear
- Binary
Correct

Incorrect
Question 8 of 10

8. Question
Which search algorithm is arguably far easier to program?
- Linear
- Binary
Correct

Incorrect
Question 9 of 10

9. Question
Which type of search is described in this algorithm?
- Linear
- Binary
Correct

Incorrect
Question 10 of 10

10. Question
Which type of search is described in this algorithm?
- Linear
- Binary
Correct

Incorrect

Copyright © 2020 ReviseComputerScience | Powered by Astra WordPress Theme

Scroll to Top

Login

Username or Email Address

Password

Remember Me

Lost Your Password?