# Computational Thinking: Abstraction and Decomposition

Computational Thinking: Abstraction and Decomposition
1 / 26
Slide 1: Slide

This lesson contains 26 slides, with interactive quizzes and text slides.

## Items in this lesson

Computational Thinking: Abstraction and Decomposition

#### Slide 1 -Slide

This item has no instructions

Learning Objective
At the end of the lesson, you will be able to explain computational thinking in depth, including abstraction and decomposition.

#### Slide 2 -Slide

Introduce the learning objective to the students and explain what they will be able to do by the end of the lesson.

#### Slide 3 -Mind map

This item has no instructions

What is Computational Thinking?
Computational thinking is a problem-solving approach that involves breaking down a problem into smaller, more manageable parts.

#### Slide 4 -Slide

Explain the concept of computational thinking and why it is important.
Decomposition
Decomposition is the process of breaking down a complex problem into smaller, more manageable parts.

#### Slide 5 -Slide

Explain what decomposition is and why it is important in computational thinking.
Example of Decomposition
An example of decomposition is breaking down the process of making a sandwich into smaller steps such as getting bread, adding condiments, and adding toppings.

#### Slide 6 -Slide

Give an example of decomposition and explain how it works.
Abstraction
Abstraction is the process of focusing on the important information only, ignoring irrelevant details.

#### Slide 7 -Slide

Explain what abstraction is and why it is important in computational thinking.
Example of Abstraction
An example of abstraction is using a map to get from point A to point B, without worrying about every single detail of the route.

#### Slide 8 -Slide

Give an example of abstraction and explain how it works.
Algorithms
Algorithms are a set of instructions that solve a specific problem.

#### Slide 9 -Slide

Explain what algorithms are and how they relate to computational thinking.
Flowcharts
Flowcharts are a visual representation of an algorithm, using symbols to represent different steps.

#### Slide 10 -Slide

Introduce flowcharts and explain how they are used in computational thinking.
Pseudocode
Pseudocode is a high-level description of an algorithm that uses plain language instead of code.

#### Slide 11 -Slide

Explain what pseudocode is and how it is used in computational thinking.
Debugging
Debugging is the process of finding and fixing errors in an algorithm.

#### Slide 12 -Slide

Explain what debugging is and why it is important in computational thinking.
Logical Thinking
Logical thinking is the process of using reasoning and critical thinking to solve problems.

#### Slide 13 -Slide

Explain what logical thinking is and how it relates to computational thinking.
Problem-Solving Strategies
There are many problem-solving strategies, including trial and error, working backwards, and breaking the problem down.

#### Slide 14 -Slide

Introduce different problem-solving strategies and explain how they are used in computational thinking.
Real-World Applications
Computational thinking is used in many different fields, including science, engineering, and business.

#### Slide 15 -Slide

Give examples of real-world applications of computational thinking and explain how it is used in different fields.
Collaboration
Collaboration is an important part of computational thinking, as it allows multiple people to work together to solve a problem.

#### Slide 16 -Slide

Explain the importance of collaboration in computational thinking and give examples of how it can be used.
Summary
Computational thinking involves breaking down a problem into smaller parts, using abstraction to focus on important information, and using logical thinking to solve problems.

#### Slide 17 -Slide

Summarize the key points of the lesson and review what the students have learned.
Quiz
Take a short quiz to test your knowledge of computational thinking and its components.

#### Slide 18 -Slide

Create a quiz for the students to take and use it as a formative assessment.
Activity: Decomposition
In small groups, break down a complex problem into smaller, more manageable parts and present your solution to the class.

#### Slide 19 -Slide

Divide the class into small groups and give them a problem to decompose. Have each group present their solution to the class.
Activity: Abstraction
In pairs, create a flowchart or pseudocode for a simple algorithm, using abstraction to focus on the important steps.

#### Slide 20 -Slide

Divide the class into pairs and have them create a flowchart or pseudocode for a simple algorithm, using abstraction to focus on the important steps.
Activity: Debugging
In pairs, identify errors in each other's algorithms and work together to fix them.

#### Slide 21 -Slide

Divide the class into pairs and have them identify errors in each other's algorithms. Encourage them to work together to fix the errors.
Activity: Real-World Applications
In small groups, research and present on a real-world application of computational thinking in a specific field.

#### Slide 22 -Slide

Divide the class into small groups and have them research a real-world application of computational thinking in a specific field. Have each group present their findings to the class.
Activity: Problem-Solving Strategies
In small groups, choose a problem-solving strategy and apply it to a given problem. Present your solution to the class.

#### Slide 23 -Slide

Divide the class into small groups and give them a problem to solve using a specific problem-solving strategy. Have each group present their solution to the class.
Write down 3 things you learned in this lesson.

#### Slide 24 -Open question

Have students enter three things they learned in this lesson. With this they can indicate their own learning efficiency of this lesson.
Write down 2 things you want to know more about.

#### Slide 25 -Open question

Here, students enter two things they would like to know more about. This not only increases involvement, but also gives them more ownership.