Algorithms 1A J277

Identify the search algorithm

• Random search
• Binary search
• Denary search
• Next Item search

Identify the 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

Identify the 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 together numbers
• 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 removing unnecessary elements

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
• The breaking down of waste to make compost

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

• 1
• 2
• 3
• 4

A binary search is to be performed on the list:

How many comparisons would it take to find the number 9?

The list is [ 3, 5, 9, 10, 23]

• 0 to 1

• 2 to 3

• 4 to 5

• It can't find the number 9

A binary search is to be performed on the list:

How many comparisons would it take to find the number 101?

The list is [ 1,5,10,13,48,68,100,101]

• 0 to 1

• 1 to 2

• 3 to 4

• 4 to 5