2.1 Algorithms - End of Topic

Which of the following is a searching algorithm?

• Random Search

• Binary Search

• Denary Search

• Next Item Search

Which is the correct description of a linear search?

• Put the elements in order, 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

Which is the correct description of a binary search?

• Put the elements in order, 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

Define the term 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 numbers together

• Taking a real world problem and designing a computer program that exactly replicates every part of that problem in the computer

• Performing multiple calculations on a list of variables

• Representing real world problems in a computer program, using symbols, and removing unnecessary elements

Define the term 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

• The breaking down of waste to make compost

Identify which statement describes algorithmic thinking:

• Thinking like a computer

• Writing binary numbers

• Identifying the steps involves in solving a problem

• identifying what problems need to be solved

A linear search is 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 performed on the list: 1, 5, 10, 13, 48, 68, 100, 101; how many comparisons would it take to find the number 101?

• 0-1

• 1-2

• 3-4

• 4-5