Duplicate of GCSE OCR CS 2.1 Algorithms (1/2)

Question 1

Which sorting algorithm splits a list of items into individual lists? (1-2)

Accepted Answer

Merge

Question 2

What sort is this? Go through a list, swap items in the wrong order, repeatedly. (1-2)

Accepted Answer

Bubble

Question 3

Identify the search algorithms (1-2)

Accepted Answer

Binary search

Question 4

The following lists are to be merged, which element first goes into the new merged list? (4-5)

Accepted Answer

1

Question 5

Which of the following is NOT a sorting algorithm? (1-2)

Accepted Answer

Binary

Question 6

Which sort is this? One item at a time, compare with ordered list, place in right order. (1-2)

Accepted Answer

Insertion

Question 7

Identify the search performed by the above algorithm (9)

Accepted Answer

Linear

Question 8

Define the term decomposition within computational thinking (1-2)

Accepted Answer

The breaking down of a problem into smaller problems

Question 9

Which sort is this? split a list into individual lists, combine these two lists at a time (1-2)

Accepted Answer

Merge

Question 10

Define the term computational thinking (1-2)

Accepted Answer

Developing an algorithm to solve a problem

Question 11

If you did a binary search on the above list. How many comparisons to find number 10? (4-5)

Accepted Answer

1-2

Question 12

Identify the description of a binary search (4-5)

Accepted Answer

Put items in order, compare middle value, split list (loop)

Question 13

Which of the following is not a component of computational thinking? (1-2)

Accepted Answer

Typing

Question 14

If you did a linear search on the above list How many comparisons to find the number 1? (6-9)

Accepted Answer

4

Question 15

Identify the description of a linear search (4-5)

Accepted Answer

Items do not need be in order, check each item in turn.

Question 16

Define the term abstraction within computational thinking (4-5)

Accepted Answer

Representing real problems in a computer program

Question 17

Identify which statement describes algorithmic thinking (1-2)

Accepted Answer

Identifying the steps involved in solving a problem

Question 18

This list will be bubble sorted. What will the list look like after the first iteration? (9)

Accepted Answer

6 8 1 3 12

Question 19

Which sorting algorithm needs to go through the list repeatedly? (4-5)

Accepted Answer

Bubble

Question 20

What is the first action in an insertion sort? (4-5)

Accepted Answer

Mark the first item as the ordered list

Question 21

If you did a binary search on the above list. How many comparisons to find 9? (4-5)

Accepted Answer

0-1

Question 22

Which sort takes an item from a list, then puts it in the correct place in a sorted list? (4-5)

Accepted Answer

Insertion

Questions 22