wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Algorithms

Total questions: 48

Worksheet time: 25mins

Name
Class
Date
1.
What is pseudocode?
a)
Simplified programming language, that is not a specific language
b)
Complicated programming language
c)
Simple programming language, which is linked to a specific language
d)
A type of cheese
2.
What flowchart symbol does this represent?
a)
Input/Output
b)
Start/End
c)
Decision
d)
Process
3.
What is this symbol?
a)
Decision
b)
Input/Output
c)
Start/End
d)
Process
4.
What does this pseudocode do?
print "Hello"
a)
Nothing
b)
Prints the word "Hello" to the output
c)
hello is print in pseudocode
d)
The code won't work
5.
Abstraction is the representation of real world problems in a computer
a)
True
b)
False
6.
What is decomposition?
a)
Breaking down of soil
b)
Breaking down of a problem into smaller chunks
c)
Making a problem a bigger deal 
d)
Breaking smaller chunks of problems into one large problem
7.
A linear search is when a list is split into 2 and compared?
a)
True
b)
False
8.
What is a binary search?
a)
Each item is checked in order
b)
The list is split into 2 and compared
c)
The first 2 values are compared and moved
d)
Nothing happens
9.
Bubble sort takes the first two values of a list, and swaps them if wrong?
a)
True
b)
False
10.
Merge Sort is?
a)
When a list is kept as one and compared
b)
List is split into 2 and merged together
c)
List is split into 2 and kept seperate
d)
Nothing
11.
An Insertion sort builds the final list two items at a time 
a)
True
b)
False
12.
What is the correct definition of an algorithm?
a)
An algorithm is a step by step instructions to solve a problem.
b)
An algorithm is a process of baking bread.
c)
An algorithm is a software used to compute numbers.
d)
An algorithm is the process of breaking problems.
13.
Decomposition is a term used to define...
a)
The process of assigning value to a variable.
b)
The process of taking out unnecessary details from problems.
c)
The process of breaking down problems into smaller problems.
d)
The process of coding a problem.
14.
Abstraction is.....
a)
The process of drawing abstract pictures.
b)
The process of assigning values to variables.
c)
The process of breaking down problems.
d)
The process of removing unnecessary details from a problem.
15.
What is a flowchart?
a)
A textual representation of algorithms.
b)
A graphical representation of algorithms.
c)
A cluster of different shapes.
d)
A program code written in Logo.
16.
What does this shape represent in flowchart?
a)
Start/Stop
b)
Decision
c)
Process
d)
Input/Output
17.
What is the correct symbol for an input in a flowchart?
a)
A diamon
b)
A square
c)
A parallelogram
d)
 A rectangle
18.
The process carried out in computer systems is represented by _______________ in flowchart.
a)
Rectangle
b)
parallelogram 
c)
Square
d)
Diamond
19.
What links each instruction in a flowchart?
a)
A line 
b)
A double line
c)
An arrow
d)
A double arrow
20.
Computers can solve any problem that can be computationally solved.
a)
TRUE
b)
FALSE
21.
Identify the search algorithm
a)
Random search
b)
Binary search
c)
Denary search
d)
Next Item search
22.
Identify the description of a linear search
a)
Put the elements in order, check each item in turn
b)
Put the elements in order, compare to the middle value, split the list in order and repeat
c)
Elements do not need to be in order, check each item in turn
d)
Elements do not need to be in order, compare to the middle value, split the list in order and repeat
23.
Identify the description of a binary search
a)
Put the elements in order, check each item in turn
b)
Put the elements in order, compare to the middle value, split the list in order and repeat
c)
Elements do not need to be in order, check each item in turn
d)
Elements do not need to be in order, compare to the middle value, split the list in order and repeat
24.
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
25.
Which of the following is not a component of computational thinking?
a)
Abstraction
b)
Typing
c)
Decomposition
d)
Algorithmic thinking
26.
Define the term abstraction within computational thinking
a)
Adding together numbers
b)
Taking a real world problem and designing a computer program that exactly replicates every part of that problem in the computer
c)
Performing multiple calculations on a list of variables
d)
Representing real world problems in a computer program, using symbols and removing unnecessary elements
27.
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
28.

A linear search is to be performed on the list above.

How many comparisons would it take to find the number 1?

a)

1

b)

2

c)

3

d)

4

29.

A binary search is to be performed on the list above.

How many comparisons would it take to find the number 9?

a)

0-1

b)

2-3

c)

4-5

d)

It can't find the number 9

30.

A binary search is to be performed on the list above.

How many comparisons would it take to the find the number 101?

a)

0-1

b)

1-2

c)

3-4

d)

4-5

31.

Identify the search performed by the above algorithm

a)

Linear

b)

Binary

c)

Both linear and binary

d)

Neither, it does not work

32.
Which of the following is not a sorting algorithm?
a)
Bubble
b)
Insertion
c)
Binary
d)
Merge
33.
Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
34.
Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
35.
Which sorting algorithm is described by: take each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
36.
What is the first action in an insertion sort?
a)
Make a new list
b)
Mark the first item as the ordered list
c)
Compare the first and second elements
d)
Put the first element in the correct place
37.

The above list is to be sorted using a bubble sort.

What will the list look like after the first iteration through the list.

a)
b)
c)
d)
38.

The two lists above are to be merged, which element first goes into the new merged list

a)

0

b)

1

c)

2

d)

3

39.
Which sorting algorithm needs to go through the list repeatedly?
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
40.
Which sorting algorithm splits a list of items into individual lists.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
41.
Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list?
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
42.

Identify the purpose of the above flowchart symbol

a)

Input/Output

b)

Output

c)

Start/Stop

d)

Decision

43.

Identify the purpose of the above flowchart symbol

a)

Process

b)

Input/Output

c)

Sub-process

d)

Decision

44.

Identify the purpose of the above flowchart symbol

a)

Process

b)

Input/Output

c)

Sub-process

d)

Decision

45.

How many arrows should come out of a decision symbol in a flowchart?

a)

0

b)

1

c)

2

d)

3

46.

The following algorithm should take as input and add together two numbers, outputting the result.


Identify the correct algorithm.

a)
b)
c)
d)
47.

The following algorithm should take as input on number, and output the 12 times table for that number.


Identify the correct algorithm.

a)
b)
c)
d)
48.

The following algorithm should take as input two numbers, add them together, multiply the answer by 11, add 4, then divide by 2. It should output the result.


Identify the correct algorithm.

a)
b)
c)
d)