Edexcel GCSE Computer Science 2020

6.1.1: be able to use decomposition and abstraction to analyse, understand and solve problems

Keywords:

Test your self on these keywords and definitions using the games below or Play random game

Keyword	Definition
abstraction	removing unnecessary detail in order to focus on what's most important
decomposition	breaking down a problem into smaller sections to make it easier to solve

All learning objectives

Keyword games:

BugZap

Connect the wires to complete the circuit and zap the bug. The faster you choose the right keyword, the more points you get for zapping the bug!

Play

Crossword

Use the clues to guess the keywords and fill in the blank spaces on the crossword

Play

Eliminate

Click on the keywords that do not match the definition

Play

Flappy Word

Click to jump. Collect a letter each time you pass a pipe

Play

Hangman Definitions

Guess the letters of the definition

Play

Hangman Keywords

Guess the letters of the keyword

Play

Jumble Keyword

Rearrange the letters of the keyword into the right order

Play

Random

Choose a game at random

Play

Snake

Control the snake to eat each letter of the keyword in order

Play

TypeRace

Type out the definitions as fast as you can

Play

Wordsearch

Find the words that match each definition

Play

Play Random Game

Resources:

Subprograms using Turtle

This code draws two squares.

Lines 6-9 and 12-16 are examples of decomposition because they break down the code into named sections (draw_square and draw_square_at) which can then be used multiple times

Lines 20 and 21 are examples of abstraction because you don't need to know how lines 6-16 work in order to call the procedure draw_square_at to draw a square at a particular set of coordinates.

Calling a subprogram uses abstraction to hide the detail of how the subprogram works Defining a subprogram uses decomposition to break code into smaller reusable sections

This code draws two squares.