2.7 Steps in algorithm to solve computational problems

Introduction

Solving computational problems requires a structured approach. Before writing code, programmers must understand the problem, break it down, and design a step-by-step solution. The core concepts of computational thinking provide the framework for this process. These concepts collectively help in designing systems and solving problems efficiently and effectively in various fields.

Definition

Computational Thinking is a problem-solving approach that uses concepts from computer science to break down complex problems, identify patterns, focus on important details, and design step-by-step solutions.

Main Idea

The core concepts of computational thinking are:

• Decomposition
• Pattern Recognition
• Abstraction
• Algorithms

These four concepts work together to help solve computational problems systematically.

Core Concept

Decomposition

The problem that needs a solution could be a complex problem that may not be solved all at once. Therefore, in decomposition, the complex problems are broken down into sub-problems, and these sub-problems are solved one at a time. By this process, it becomes understandable and simple.

Example: If you want to build a house, you cannot build it all at once. You break it down into: foundation, walls, roof, plumbing, electrical, etc. Each part is solved separately.

Pattern Recognition

We solve different problems in daily life, but when we analyze, many problems have similar patterns. Identification of these similarities and differences in data or problems helps you to make a general solution.

Example: When sorting a list of numbers, you notice that the same process (comparing and swapping) is repeated. This pattern helps in designing sorting algorithms.

Abstraction

Focusing on the important information only and ignoring irrelevant details. Abstraction helps in reducing complexity and makes it easier to develop solutions.

Example: When using a map application, you focus on roads and landmarks and ignore details like trees, houses, or specific building colors.

Algorithms

Algorithms are the step-by-step solution to a problem. Each step defines some rule to follow that can solve the problem. For automation and efficiency of a system, algorithms are considered an essential part of problem-solving.

Example: A recipe for making tea is an algorithm: boil water, add tea bag, pour water, wait, remove bag, add sugar/milk, stir.

Detailed Explanation

How the Steps Work Together

• Decomposition: Break the big problem into smaller, manageable parts.
• Pattern Recognition: Look for similarities or repeated patterns among the parts.
• Abstraction: Focus on the important details and ignore the irrelevant ones.
• Algorithm: Design a step-by-step solution for each part and then combine them.

Example: Solving a Computational Problem

Problem: Calculate the average marks of 100 students.

• Collect marks for each student.
• Add all marks.
• Divide the total by 100.

Step 2: Pattern Recognition Notice that adding marks is repeated 100 times. This suggests using a loop.

Step 3: Abstraction Focus on the marks and the total. Ignore student names, addresses, etc.

• Start with total = 0.
• For each student from 1 to 100:
• Average = total / 100.
• Display average.

Intermediate Level

At the intermediate level, you should understand how these concepts apply to programming.

• Decomposition: Break a large program into functions or modules.
• Pattern Recognition: Use loops for repeated tasks.
• Abstraction: Use variables and functions to hide complexity.
• Algorithm: Write pseudocode or flowcharts before coding.

• Decomposition: add item, remove item, display list.
• Pattern Recognition: adding and removing follow similar logic.
• Abstraction: use an array to store items; ignore how the array is stored in memory.
• Algorithm: write step-by-step functions for each operation.

Important Points

• - Computational thinking has four core concepts.
• - Decomposition: break down complex problems.
• - Pattern Recognition: identify similarities and patterns.
• - Abstraction: focus on important details, ignore irrelevant ones.
• - Algorithms: step-by-step solutions.
• - These concepts work together to solve problems systematically.

Remember

• - Decomposition = break down.
• - Pattern Recognition = find similarities.
• - Abstraction = focus on important.
• - Algorithms = step-by-step solution.
• - All four work together.

Common Mistakes

• - Skipping decomposition and trying to solve the whole problem at once.
• - Not recognizing patterns and writing repetitive code.
• - Including irrelevant details instead of using abstraction.
• - Writing an algorithm without first understanding the problem.
• - Confusing abstraction with decomposition.
• - Thinking that computational thinking is only for computers (it is useful in daily life too).

Quick Revision

• Computational thinking: solving problems using computer science concepts.
• Four core concepts: Decomposition, Pattern Recognition, Abstraction, Algorithms.
• Decomposition: break complex problems into sub-problems.
• Pattern Recognition: identify similarities and patterns.
• Abstraction: focus on important information.
• Algorithms: step-by-step solutions.
• These concepts help design efficient solutions.

60-Second Revision

• Decomposition = break down.
• Pattern Recognition = find patterns.
• Abstraction = focus on important.
• Algorithms = step-by-step.
• All four work together.
• Warning: Don't skip decomposition or abstraction; they make complex problems manageable.