Year 7: Algorithms Summer 1: Homework:3

Breaking down a problem into smaller parts is known as (a)  

• Decomposition

• Integration

• Aggregation

• Simplification

Ignoring irrelevant detail is known as (a)  

• Abstraction

• Detailing

• Generalization

• Specification

Developing a step-by-step solution to a problem is known as (a)  

• Algorithms

• Programming

• Debugging

• Testing

Breaking down a complex problem into smaller parts is known as (a)  

• Decomposition

• Aggregation

• Simplification

• Integration

Complete the sentence: Ignoring irrelevant detail is known as (a)  

• Abstraction

• Generalization

• Simplification

• Summarization

Developing a step-by-step solution to a problem is known as (a)  

• Algorithms

• Data Structures

• Programming

• Debugging

What does a search algorithm do?

• Save data in a list
• Sort data in a list
• Write data to a list
• Search data in a list

A Linear search algorithm requires data to be ordered.

• True
• False

Bubble sort takes the first two values of a list, and swaps them if wrong?

• True
• False

How does a binary search algorithm works?​

• Dividing the list into halves until the item is matched with one in the list.​

• Starts with the first element and checks the next element consecutively until a match is found.

• ​ None of the above​