Search Algorithms

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 

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, using symbols and removing unnecessary elements 

Identify the correct definition for 'algorithm'

• A problem
• A solution to a problem
• The steps that are taken to solve a problem
• The words to enter when typing

Which of these is a type of searching algorithm?

• Linear search
• Word search
• Search engine
  

What is an advantage of a linear search?

• It is very quick
• It only works with ordered lists
• It is a simple algorithm

What is an advantage of a binary search

• It's very quick
• It only works with ordered lists
  
• It is a simple algorithm

What is the biggest disadvantage of a binary search?

• It is slow
• It can only be used if the data is sorted into an order
  
• It takes the data and keeps dividing it in half until it finds the item it is looking for