Kablow!

Computational thinking: decomposition, abstraction and algorithms

플레이하며 배우기

이 문제들을 풀어 에너지를 얻은 뒤 낚시하고 탐험하세요. 계정이 필요 없어요.

교육자를 위해: Computational thinking: decomposition, abstraction and algorithms(Computer Science, Algorithms)을(를) 위한 바로 쓸 수 있는 수업 슬라이드, 복습 노트 — 수업에 사용하거나, 학습자들이 실시간 게임으로 즐기는 인터랙티브 클래스 활동으로 진행하세요.
수업 노트슬라이드연습 문제

수업 노트

Computational thinking

  • Computational thinking is a way of solving problems so that a computer can help. Its main parts are decomposition, abstraction, pattern recognition and algorithmic thinking.
  • Decomposition: breaking a big problem into smaller, more manageable parts. Planning a school timetable can be split into rooms, teachers, classes and times.
  • Abstraction: removing unnecessary detail to focus on what matters. A map of the Tube shows stations and lines, not every street.
  • Pattern recognition: spotting similarities, so a solution can be reused.

Decomposition

Decomposition

Algorithms

  • An algorithm is a finite, ordered set of unambiguous steps for a task. It terminates for each valid input in the model used here, but different inputs may take different numbers of steps. Algorithms may process stored input and need not request new user input.
  • Algorithms can be shown in plain English, flowcharts or pseudocode.
  • Structure: sequence (steps in order), selection (decisions: IF), iteration (repeating: loops).

What is an algorithm?

What is an algorithm?

Example

  • Algorithm to find the larger of two numbers: input A, input B; if A is greater than B then output A, otherwise output B.

Why it matters

  • Computational thinking helps design programs that are efficient and easy to test and change.

Control structures

  • Sequence follows instructions in order; selection chooses a branch; iteration repeats a body.
  • Example: input a mark, use IF to choose pass/fail, and repeat for each student.
  • Choose relevant details: omit button styling when designing scoring logic, but retain it when designing the interface.

Sequence in algorithms

Sequence in algorithms

슬라이드

Sign up free to view the lesson slides

Step through every slide for this topic — plus flashcards and revision notes — with a free account.

가입 — 무료로그인

연습 문제

무료 미리 보기 — 34개 중 8개 문제. 가입하면 전부 볼 수 있어요.

  1. 1.What is an algorithm?

    Easy
    • Aa set of step-by-step instructions to solve a problem
    • Ba type of computer
    • Ca programming language
    • Da hardware part

  2. 2.What is decomposition?

    Easy
    • Abreaking a problem into smaller parts
    • Bhiding details
    • Crepeating steps
    • Dfixing errors

  3. 3.What is abstraction?

    Easy
    • Afocusing on important details and ignoring the rest
    • Bbreaking into parts
    • Crepeating
    • Dtesting

  4. 4.What is pattern recognition?

    Easy
    • Aspotting similarities or trends
    • Bremoving detail
    • Clooping
    • Ddeleting

  5. 5.Which structure repeats instructions?

    Easy
    • Aiteration
    • Bselection
    • Csequence
    • Dinput

  6. 6.Which structure makes a decision?

    Easy
    • Aselection
    • Biteration
    • Csequence
    • Doutput

  7. 7.Which is an example of abstraction?

    Easy
    • Aa Tube map showing stations but not streets
    • Ba list of all streets
    • Ca photograph
    • Da full city plan

  8. 8.Which is an example of decomposition?

    Easy
    • Asplitting a game into graphics, sound, scoring and controls
    • Bwriting one long program
    • Cignoring parts
    • Ddeleting code

Unlock all 34 questions & more

무료 계정을 만들어 이 주제의 모든 문제, 슬라이드, 플래시카드, 복습 노트를 확인하세요.

가입 — 무료로그인

기출 문제

이 주제의 기출 문제 연습이 곧 나와요.
곧 출시