wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Problem Solving and Algorithms - Grade 9

Total questions: 11

Worksheet time: 12mins

Name
Class
Date
1.

Which of these are pillars of computational thinking?

a)

Decomposition: Breaking down data, processes, or problems into smaller, manageable parts

b)

Pattern Recognition: Observing patterns, trends, and regularities in data

c)

Abstraction: Identifying the most important details and discarding the unimportant aspects to make the solution manageable

d)

Algorithm Design: Developing the step by step instructions for solving this and similar problems

e)

Functional programming - treats computation as the evaluation of mathematical functions and avoids changing-state and mutable data

2.

Which of these are true about algorithms?

a)

The steps/instructions can be ambiguous

b)

Algorithms rely heavily on syntax

c)

Languages like python cannot be used to write an algorithm

d)

Algorithms are about expressing thinking steps not syntax

3.

Define the term computational thinking

a)

Using a computer

b)

Developing an algorithm to solve a problem

c)

Making a computer use artificial intelligence

d)

Google is computational thinking

e)

Solving a problem using a computer

4.

Select the three basic building blocks when designing an algorithm.

a)

Sequencing

b)

Selection

c)

Iteration

d)

Functions

5.

What is sequencing?

a)

When instructions are carried out one after another.

b)

The order in which a computer chooses to load programs.

c)

When data is sent to a web server and back again

d)

How a hard disk loads information into main memory.

6.

The following is a simple algorithm using selection:

INPUT age

IF age > 18

OUTPUT adult

ELSE

OUTPUT child

What would the output be if age = 14?

a)

adult

b)

child

c)

none

7.

When designing algorithms, there may be some steps that need (a)   . This is known as iteration.

8.

Iteration in programming means repeating steps, or instructions over and over again. This is often called a (a)   .

9.

Why do we need searching algorithms?

a)

To load an operating systems instruction set.

b)

To make a CPU run.

c)

To find a particular item among millions of pieces of data.

d)

To allow a computer to iterate through millions of instructions quickly.

10.

Why do we need sorting algorithms?

a)

To load the computers operating system.

b)

To put a list of data items in order, e.g. alphabetical/numerical.

c)

So the CPU can work with more than one instruction at a time.

d)

So a computer knows which order to carry out its tasks.

11.

What would be the output if the lamp is plugged in but the bulb has burned out?

(a)