Computational thinking Flashcards

(11 cards)

1
Q

What is decomposition?

A

• Breaking a problem into smaller sub-problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why is decomposition useful?

A

• Makes a problem easier to understand
• Makes solutions easier to design
• Makes debugging easier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is abstraction?

A

• Removing unnecessary detail
• Focusing on what matters

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Why is abstraction useful?

A

• It helps you focus on the important parts
• It stops time being wasted on unnecessary detail

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is algorithmic thinking?

A

• Creating a clear set of steps to solve a problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why is algorithmic thinking useful?

A

• It helps create clear step-by-step solutions
• It helps find an efficient method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is pattern recognition?

A

• Finding similarities in problems or solutions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Why is pattern recognition useful?

A

• It helps spot repeated features
• It allows existing solutions or code to be reused

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is an algorithm?

A

• A sequence of steps to solve a problem or complete a task

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are the three stages of an algorithm?

A

• Input
• Processing
• Output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are three common ways to represent an algorithm?

A

• Pseudocode
• Program code
• Flowchart

How well did you know this?
1
Not at all
2
3
4
5
Perfectly