2.1 Algorithms (Key Terms, Sort and Search)

What is the definition of computational thinking.

• Development of algorithms to solve problems.

  
  

  Using abstraction, decomposition and algorithmic thinking.

• representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

• breaking down a large problem into smaller sub-problems.

• Identifying the steps involved in solving a problem.

What is the definition of abstraction.

• Development of algorithms to solve problems.

  
  

  Using abstraction, decomposition and algorithmic thinking.

• representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

• breaking down a large problem into smaller sub-problems.

• Identifying the steps involved in solving a problem.

What is the definition of decomposition.

• Development of algorithms to solve problems.

  
  

  Using abstraction, decomposition and algorithmic thinking.

• representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

• breaking down a large problem into smaller sub-problems.

• Identifying the steps involved in solving a problem.

What is the definition of algorithmic thinking.

• Development of algorithms to solve problems.

  
  

  Using abstraction, decomposition and algorithmic thinking.

• representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

• breaking down a large problem into smaller sub-problems.

• Identifying the steps involved in solving a problem.

What are the two searches you must know for the exam

Answers: 2

• Binary

• Linear

• Bubble

• Merge

• Insertion

Which best defines a binary search?

• An ordered list is divided in 2 with each comparison.

• Each item in the list is checked in order.

Which best defines a linear search?

• An ordered list is divided in 2 with each comparison.

• Each item in the list is checked in order.

Which best describes a binary search?

Answers: 2

• The search only works if data is in order

• The list does not need to be in order

• The worst case scenario is you have to check half the values

• The worst case scenario is you have to check all the values

Which best describes a linear search?

Answers: 2

• The search only works if data is in order

• The list does not need to be in order

• The worst case scenario is you have to check half the values

• The worst case scenario is you have to check all the values

Which image shows a linear search?

• 
•