7.5.4 PLENARY

Iteration is defined as (a)  

• the repetition of instructions
• a single execution of a loop
• a conditional statement
• a function call

Define algorithm

• An algorithm is a step-by-step procedure for solving a problem.
• An algorithm is a type of computer hardware.
• An algorithm is a random guess for solving a problem.
• An algorithm is a collection of unrelated data.

A count controlled loop will..

• Repeat code until a condition is met

• Repeat code a specific amount of times

• Repeat code a random amount of times

• None of the above

A condition controlled loop will..

• Repeat code until a condition is met

• Repeat code a specific amount of times

• Repeat code a random amount of times

• None of the above

Why is iteration important?

• It determines the order in which instructions are carried out
• It allows code to be simplified by removing duplicated steps
• It allows multiple paths through a program
• It ensures the code works correctly

Organize these algorithms into the right types of iteration

Groups:

(a) Count controlled

,

(b) Condition Controlled

,

(c) No iteration

• A cat algorithm that ends when the mouse is caught or if it starts raining

  
  

• A videogame algorithm that lets you have 3 tries

  
  

• A cooking algorithm which asks you to knead bread 10 times

  
  

• A hairdressing algorithm that ends once the customer is happy or has run out of money

  
  

• An algorithm that tells you how to say hi in French

• A music algorithm that suggests new songs until the user plays one

  
  

• A video algorithm that suggests 10 new videos 

  
  

• An algorithm that shows 5 different pictures of cats and then ends

​ (a)   is the removal of unnecessary detail from a ​ (b)  

• Abstraction
• problem
• Decomposition
• algorithm
• code
• Iteration

​ (a)   is breaking a ​ (b)   down into smaller ​ (c)  

• Decomposition
• problem
• problems
• Abstraction
• Iteration
• algorithm
• algorithms

We use this when...

• Count controlled iteration

• When there is too much unnecessary detail

• Condition controlled iteration

• When we don't know how many times something will repeat

• Decomposition

• When the problem is too big to know where to start

• Abstraction

• When we know how many times something will repeat