7.5.2 PLENARY

Match the words to the definitions

• Iteration

• Breaking a problem down into a number of smaller problems

• Decomposition

• the repetition of instructions

• Algorithm

• A detailed set of instructions to solve a task

• Abstraction

• Removing unnecessary detail from a problem

Which of the following are examples of problems that have been abstracted? Select two.

• A road map

• A train

• An underground (tube) map

• A road

Complete the text below using the words beneath. When trying to solve a problem in programming, we first try to consider the important ​ (a)   of the problem without thinking too much about the ​ (b)   details. This process is called ​ (c)   . It allows us to create general solutions that can solve many similar problems.

• purpose
• smaller
• abstraction
• decomposition
• important

Why do we decompose a complex problem?

• To make it easier to solve

• To make it more difficult to solve

• To change the problem we have

What is decomposition?

• Adding detail to make a problem more complex

• Breaking down a complex problem or system into smaller, more manageable parts

• When you ignore the unnecessary detail in a problem

Why do we decompose a complex problem?

• To make it more difficult to solve

• To change the problem we have

• To make it easier to solve

Where were the important details in text?

Write the definition for the term algorithm

Write the definition for the term abstraction

hint: it includes "unnecessary"

Write the definition for the term decomposition