Computing

Question 1

1Breaking a big problem into smaller parts is

Easy

A. encryption B. compilation C. abstraction D. decomposition

Question 2

2A selection construct in a program allows

Easy

A. choosing between paths based on a condition B. repeating forever C. storing data only D. printing only

Question 3

3A table used to follow the values of variables step by step through an algorithm is a

Easy

A. truth table B. flowchart C. hash table D. trace table

Question 4

4Pseudocode is

Easy

A. a programming language compiler B. machine code C. an informal way of writing an algorithm in structured English D. a type of virus

Question 5

5What is the output of the pseudocode: x ← 1; REPEAT x ← x × 2 UNTIL x > 20; OUTPUT x

Hard

A. 32 B. 64 C. 20 D. 16

Question 6

6Pattern recognition in computational thinking means

Easy

A. drawing patterns B. coding colours C. spotting similarities between problems D. typing fast

Question 7

7Ignoring unnecessary detail and focusing on what matters is

Easy

A. iteration B. abstraction C. debugging D. decomposition

Question 8

8Abstraction means

Easy

A. removing unnecessary detail to focus on the important parts B. adding more detail C. writing code D. testing programs

Question 9

9Breaking a problem into smaller parts is

Easy

A. decomposition B. abstraction C. pattern recognition D. debugging

Question 10

10A trace table is used to

Hard

A. record variable values as an algorithm runs B. design hardware C. store files D. print reports