Computational Thinking

Question 1

Decomposition

Answer 1

The process of breaking down a problem into smaller sub-problems

Question 2

Abstraction

Answer 2

the process of removing unnecessary details and focusing on important ones

Question 3

Algorithm

Answer 3

A precice method/set of instructions for solving a specific problem

Question 4

Sequence

Answer 4

the order in which the statements are executed.

Question 5

Selection

Answer 5

picking a path based on input

Question 6

Repetition

Answer 6

the part of the code that loops until a certain bit is true

Question 7

Iteration

Answer 7

a function that repeats a block of code in a specified order, often until a specific result occurs

Question 8

Count-controlled

Answer 8

A definite loop that repeats a certain amount of time

Question 9

Condition controlled

Answer 9

A loop that keeps looping until a condition is met

Question 10

Variable

Answer 10

Holds a value that can change

Question 11

Constant

Answer 11

A variable that does not change, eg. Pi, VAT, Gravity

Question 12

One-dimensional data structure

Answer 12

data in a list (provided that the data is of the same data type)

Question 13

Two-dimensional data structure

Answer 13

A collection of data elements arranged in a grid-like structure with rows and columns

Question 14

Arithmetic operator

Answer 14

+ - / * **

Question 15

Relational operators

Answer 15

< >

Question 16

Logical operators

Answer 16

AND, OR, NOT

Question 17

Syntax error

Answer 17

Syntax errors are mistakes in the use of the Python language, and are analogous to spelling or grammar mistakes in a language like English

Question 18

Logic error

Answer 18

They occur when the program runs without crashing, but produces an incorrect result. The error is caused by a mistake in the program’s logic.

Question 19

Runtime error

Answer 19

A run-time errorhappens when Python understands what you are saying, but runs into trouble when following your instructions.

Question 20

Overflow error

Answer 20

when the result of a calculation is too large to be represented in the number of bits allocated

Question 21

Bubble sort

Answer 21

repeatedly gioing through a list, comparing adjacent items and swapping the items if in the wrong order.

Question 22

Linear search

Answer 22

an algorithm that involves checking each item in a list or sequence of items one at a time in order (hence, linear) to see if it’s the right item.

Question 23

Binary search

Answer 23

A binary search checks the middle number each time.

Question 24

Logical reasoning and test data

Question 25

Robust software

Answer 25

Can handle errors without crashing.

Question 26

Audit trails

Answer 26

keeping track of who made what changes (and when) during development.