Decomposition and abstraction (Edexcel GCSE Computer Science): Flashcards

📚Flashcards
Decomposition and abstraction
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

13 cards from this deck

Show

Decomposition (definition)

Breaking complex problems into smaller, manageable parts

Abstraction (definition)

Removing unnecessary details to focus on important points

Type of skills: decomposition & abstraction

Computational thinking skills

Main advantage of decomposition

Transforms one overwhelming problem into several manageable tasks

Decomposition in programming appears as

Subprograms or groupings of code lines

What abstraction helps distinguish

Essential features from irrelevant/decorative ones

Abstraction in code appears in

Names of variables, data structures, or subprograms

Algorithm (definition)

Precise instructions needed to solve a problem

Key benefit of algorithms

Reusability - can be used again with slight modifications

Relationship: computer programs & algorithms

Every computer program is essentially an algorithm

Algorithms are the outcome of applying

Decomposition and abstraction

Name one decomposition task from snakes & ladders example

Rolling dice (or displaying board, moving player, taking ladder, etc.)

Essential features in seating simulation abstraction

Color, number of legs, inside/outside use, or capacity

Join 100,000+ GCSE students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.