2.1 Computational Thinking and Search Algorithms Quiz

Identify the search algorithm:

• Spotlight search

• Binary search

• Denary search

• Next item search

Identify the description of a linear search:

• Put the elements in order, start at the first item, check each item in turn

• Put the elements in order, compare to the middle value, split the list in order and repeat

• Elements do not need to be in order, check each item in turn

• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Identify the description of a binary search:

• Put the elements in order, start at the first element, check each item in turn

• Start with elements in order, compare to the middle value, split the list in half and repeat

• Elements do not need to be in order, check each item in turn

• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Which term is part of computational thinking?

• Using a computer

• Developing an algorithm to solve a problem

• Making a computer use artificial intelligence

• Google is computational thinking

Which of the following is not a component of computational thinking?

• Abstraction

• Typing

• Decomposition

• Algorithmic thinking

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

Define the term decomposition within computational thinking:

• 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

Identify which statement describes algorithmic thinking:

• Thinking like a computer

• Writing binary numbers

• Identifying the steps involved in solving a problem

• Identifying what problems need to be solved

A linear search is to be performed on the list: [12, 6, 8, 1, 3]. How many comparisons would it take to find the number 1?

• 1

• 2

• 3

• 4

A binary search is to be performed on the numbers below: [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