Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

2.1 Algorithms and Computational Thinking

Total questions: 10

Worksheet time: 5mins

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 is an example of decomposition?

a)

Break a program into procedures and functions

b)

Break a complex problem into modules using top down design

c)

Use a pre-written library of procedures and functions to perform operations such as sorting and searching.

d)

Subdividing a problem into smaller tasks that different teams can work on independently.

e)

Ignore the colour of a player token in a snakes ladder game model.

3.

Which of these is an example of abstraction?

a)

The layers in a network protocol stack

b)

Break a complex problem into modules using top down design

c)

Use a pre-written library of procedures and functions to perform operations such as sorting and searching.

d)

Subdividing a problem into smaller tasks that different teams can work on independently.

e)

Ignore the colour of a player token in a snakes ladder game model.

4.

Which of these is true about abstraction?

a)

The relevant details depend on what is being modeled.

b)

The unimportant details are ignored

c)

The relevant details depend on your opinion.

d)

An 8 bit integer is an abstraction of a whole number.

e)

Logic gates are an abstraction of transistor logic circuits.

5.

Which of these are true about algorithms?

a)

The steps/instructions can be ambiguous

b)

The lowest level of the algorithm can be expressed any way as long as the instruction/step is clear and can be treated as a simple computational process.

c)

Algorithms rely heavily on syntax

d)

Algorithms are about expressing thinking steps not syntax

e)

Python like code cannot be used to write an algorithm

6.

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

7.

Which of the following is not a component of computational thinking?

a)

Abstraction

b)

Typing

c)

Decomposition

d)

Algorithmic thinking

e)

Pattern recognition/Generalising

8.

Define the term abstraction within computational thinking

a)

Adding numbers together

b)

Taking a real world problem and designing a computer program that exactly replicates every part of that problem in the computer

c)

Representing real world problems in a computer program, using symbols and removing unnecessary element

d)

Performing multiple calculations on a list of variables

9.

Define the term decomposition within computational thinking

a)

The breaking down of a program until it no longer exists

b)

The creation of music that can be played on a computer

c)

The breaking down of a problem into smaller problems

d)

The breaking down of waste to make compost

10.

Identify which statement describes algorithmic thinking

a)

Thinking like a computer

b)

Writing binary numbers

c)

Identifying the steps involved in solving a problem

d)

Identifying what problems need to be solved