1.2 Problem solving - Decomposition and Abstraction

What is Decomposition?

• •– 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.

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.

Why do we need to think computationally?

• To help us program
• To help us solve complex problems more easily
• To help us to think like a computer

Which of the following is NOT a computational thinking technique?

• Decomposition
• Abstraction
• Coding

Looking for similarities among and within problems.

• decomposition
• pattern recognition
• abstraction
• algorithms

Tags

CCSS.8.EE.C.7B

What is abstraction?

• A painting
• A programming language
• This means focusing on the important details and ignoring the irrelevant information
• Abstraction is the breaking down of a big problem into smaller parts.

Which type of search algorithm is this?

• Binary

• Linear

Which search algorithm is the easiest to understand?

• Binary

• Linear

Which type of sort algorithm is this?

• Bubble

• Merge

• Insertion

Which type of sort algorithm is this?

• Bubble

• Merge

• Insertion