Computational Thinking
Computational Thinking
Algorithm Design
Decomposition is the process of breaking down a problem or challenge –
even a complex one – into small, manageable parts.
Breaking a problem down into smaller parts.
Decomposition
Example:
Cleaning the house (To-do List)
Reviewing or Studying
Divide and conquer method
Classroom Monitorial
Lesson Plan
Abstraction
Example:
Operation of mobile phone.
Coffee in coffee
machine
Classroom escape
room activity
Mnemonics
Power-Point
Presentation of lesson
Pattern recognition
Example
Sudoku
Chess
Uno
Tetris
Origami
Algorithm Design
Example:
Rubik’s Cube
Coding
Maze game
Tic-Tac-Toe
Tying shoelaces
Decomposition
Break the task into smaller parts:
Decide on a theme.
Create a guest list.
Plan the food and drinks.
Choose decorations.
Organize activities and games.
Send invitations.
Pattern Recognition
Identify patterns from past events:
Guests usually prefer a mix of snacks and
drinks.
Games are more engaging if they suit the
Abstraction
Focus on what’s important and ignore unnecessary
details:
Important: The number of guests, theme-
related activities, and food preferences.
Ignore: Things like whether the plates match
exactly or the timing of minor activities.
Algorithm Design
Develop a step-by-step plan:
Decide on a theme (e.g., "Retro Party").
Make a guest list and finalize the number of
attendees.
This scenario shows how all four pillars of
computational thinking work together to solve a
real-life problem in an organized way.