2.1 Algorithms

What is a binary search?

• a search where elements are in order and, starting with the first element, compare each item in turn

• a search where elements are not in order and, starting with the first element, compare each item in turn

• a search where elements are in order and your compare the middle value to value you are searching for, then split the list and repeat

• a search where elements are not in order and your compare the middle value to value you are searching for, then split the list and repeat

What is a linear search?

• a search where elements are in order and, starting with the first element, compare each item in turn

• a search where elements are not in order and, starting with the first element, compare each item in turn

• a search where elements are in order and your compare the middle value to value you are searching for, then split the list and repeat

• a search where elements are not in order and your compare the middle value to value you are searching for, then split the list and repeat

What is decomposition?

• the breaking down of a program until it no longer exists

• the creation of music that can be played on a computer

• the breaking down of a problem into smaller problems

• adding detail to a solution to make it more complex

The following two lists are to be merged using a merge sort. Which element first goes into the new merged list? The lists are 0 indexed.

• List 1 Item 0

• List 2 Item 0

• List 1 Item 1

• List 2 Item 3

Which sorting algorithm splits a list of items into individual values?

• Merge

• Bubble

• Insertion

• Binary

Define the term abstraction within computational thinking:

• Adding together numbers

• Adding additional levels of detail to a problem to define it

• Performing multiple calculations on a list of variables

• Removing unnecessary details from a problem

A binary search is to be performed on the numbers: 3, 5, 9, 10, 23. How many comparisons would it take to find the number 9?

• 1

• 2-3

• 4-5

• It can't find the number 9

A linear search is to be performed on the numbers: 32, 15, 17, 5, 2. How many comparisons would it take to find the number 17?

• 1

• 3

• 4-5

• It can't find the number 9

Which error may produce unexpected results in a program?

• Linear

• Sum

• Logic

• Syntax

Which sorting algorithm needs to go through the list repeatedly?

• Filter

• Bubble

• Insertion

• None of them do