Computational thinking - EQ

Iteration is defined as:

• A process of repeating a set of instructions a specified number of times or until a condition is met.

• A method of storing data in a table.

• A way to connect computers in a network.

• A technique for encrypting information.

State the type of data structure used to hold the ink colours.

• List

• Stack

• Queue

• Tree

Give the contents of inkColours[2].

• Yellow

• Red

• Blue

• Green

State the name of the computational thinking technique used by the subprogram displayAll() to hide the logic of printing.

• Abstraction

• Iteration

• Decomposition

• Pattern Recognition

State the name of the computational thinking technique used when separating logic into different blocks, such as the subprogram and the main program.

• Decomposition

• Abstraction

• Iteration

• Pattern Recognition

Here is an algorithm that uses colours.

Give the first line number of a condition-controlled loop.

• 15

• 10

• 7

• 12

Which sorting algorithm is not a divide and conquer algorithm?

• Bubble sort

• Merge sort

• Quick search

• Linear search

Which search algorithm is described as a divide and conquer algorithm?

• Binary Search

• Linear Search

• Quick Sort

• Bubble sort

The number of comparisons in a sorting algorithm affects its execution time by:

• Increasing the number of comparisons increases the execution time.

• Decreasing the number of comparisons increases the execution time.

• The number of comparisons has no effect on execution time.

• Execution time is only affected by memory usage.

State the two different results of evaluating a conditional test.

• 1. True 2. False

• 1. Yes 2. No

• 1. Pass 2. Fail

• 1. On 2. Off