J276 2.1 Algorithms

If you have a large amount of data to search through the best algorithm would be a 

• Binary Search
• Linear Search

Which search algorithm is the easiest to understand?

• Binary
• Linear

Which search algorithm is more likely to complete the search in fewer steps?

• Binary
• Linear

If the data is in order the best search to use would be a

• Binary Search
• Linear Search

An algorithm is...

• A set of steps to follow in order
• When you sort data into the correct order
• When you search data for a specific entity

Which of these is NOT a search algorithm

• Binary
• Linear
• Bubble

When is a binary search faster than a linear search?

• When there is a large amount of data
• When there is a small amount of data

Breaking a complex problem down into smaller problems and solving each one individually.

• Decomposition
• Abstraction
• Programming
• Algorithmic Thinking

What is abstraction?

• The process of filtering out unnecessary detail.
• The process of filtering out irrelevant characteristics
• The process of filtering out irrelevant characteristics and unnecessary detail.

What is Abstraction?

• The use of computers to solve problems.
• 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.