stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
GCSE Algorithms Flashcards | StudBud
Explore
/
GCSE Algorithms
GCSE Algorithms
18 terms
·
StudBud Administration
·
41 plays
A #computing quiz to reinforce teaching of algorithms
Flashcards
18 cards
F
Practice quiz
P
Host live
L
Questions
18
Answers
1
Identify the description of a linear search
Put values in order, compare middle value & split list
Check each item in turn even when not in order.
Compare middle value & split list even when not in order
Put the values in order, check them each turn
2
How many comparisons would it take to find the number 1 using a linear search?
3
4
2
1
3
Identify the search algroithm
Random Search
Denary Search
Insertion Search
Binary Search
4
Identify the description of a binary search
Check each item in turn even when not in order.
Compare middle value & split list even when not in order
Put the values in order, check them each turn
Put values in order, compare middle value & split list
5
Which algorithm takes an item from a list, and puts it in its correct place?
None
Merge
Bubble
Insertion
6
The following list is sorted using bubble sort. What will it look like after the first pass?
[6, 12, 1, 8, 3]
[6, 8, 1, 3, 12]
[1, 3, 6, 8, 12]
[6, 8, 1, 12, 3]
7
Which algorithm is described by: moving through a list, swapping elements that in wrong order
Merge
Insertion
None of the above
Bubble
8
Which sorting algorithm needs to go through the list repeatedly?
Insertion
Merge
Bubble
None
9
Which algorithm is described by: take each item, compare it and place it in ordered position.
Merge
None of the above
Bubble
Insertion
10
Which type or search does not work if the entries are not it order?
Merge
Bubble
Linear
Binary
11
Which of the following is not a component of computational thinking?
Abstraction
Problem solving
Decomposition
Typing
12
Which of the following is not a sorting algorithm?
Insertion
Bubble
Merge
Binary
13
The following two lists are to be merged, which element goes first into the new list?
0
3
23
1
14
How many comparisons would it take to find the number 9 using a linear search?
3
4
1
2
15
Which algorithm splits a list of items into individual lists?
Insertion
Bubble
None
Merge
16
Define the term computational thinking
Developing algorithms to solve a problem
Making computers use artificial intelligence.
Using Google to find answers.
Using computers to think
17
Which algorithm is described by: split items in individual lists then combine them, 2 at a time
None of the above
Bubble
Insertion
Merge
18
Which algorithm is described by: take an, divide it by 2, move to front.
Merge
Insertion
None of the above
Bubble
