1.7 (paper 2 from onwards) Flashcards

1
Q

Define computational thinking.

A

Solving problems that can be implemented by a computer system is known as computational thinking.

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

Define abstraction.

A

Abstraction is the process of removing unnecessary details of a problem to focus on the important features to implement in a solution.

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

Define decomposition.

A

Decomposition is the process of breaking down a large problem into a set of smaller problems to make the problem easier to solve.

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

Define algorithmic thinking.

A

Algorithmic thinking is the process of creating step-by-step instructions in order to produce a solution to a problem.

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

State the three main principles of computational thinking.

A

The three main principles of computational thinking are:

Abstraction

Decomposition

Algorithmic thinking

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

Define a searching algorithm?

A

Searching algorithms are precise step-by-step instructions that a computer can follow to efficiently locate specific data in massive datasets.

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

Describe a binary search?

A

A binary search keeps halving a dataset by comparing the target value with the middle value, going left if smaller, right if bigger, until it finds the value or realises the value is not there.

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

Describe a linear search?

A

A linear search starts with the first value in a dataset and checks every value one at a time until all values have been checked.

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

State an advantage of linear search over binary search and an advantage of binary search over linear search.

A

Linear search works on unsorted datasets.
Binary search is fast for large datasets.

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

Define a process?

A

A process is a doing action performed in the algorithm that transforms inputs into the desired output.

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

What is a structure diagram?

A

A structure diagram is a visual representation of problem decomposition.

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

Define the term manageable (in the context of structure diagrams).

A

Manageable refers to sub-problems that are small enough to be handled or dealt with more easily than the original complex problem.

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

Define the term analysis

A

Analysis is the process of studying or examining a problem in detail to understand its nature and determine a solution.

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

Which flowchart symbol is used for decisions?

A

Diamond

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

Define syntax error.

A

A syntax error is an error that breaks the grammatical rules of a programming language and stops it from running.

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

Define a logic error

A

A logic error is where incorrect code is used that causes the program to run, but produces an incorrect output or result.

17
Q

True or False?

A logic error occurs when the program does not produce the expected output due to incorrect programming logic.

A

True.

The definition of a logic error is where incorrect code is used that causes the program to run, but produces an incorrect output or result.