wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Year 11 Unit 7 IGCSE Algorithm Quiz

Total questions: 42

Worksheet time: 30mins

Name
Class
Date
1.

What flowchart symbol does this represent? (a)  

Choose from the below words
Input/Output
Start/End
Decision
Process
2.
What is this symbol?
a)
Decision
b)
Input/Output
c)
Start/End
d)
Process
3.
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
4.
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
5.
Bubble sort takes the first two values of a list, and swaps them if wrong?
a)
True
b)
False
6.

What is an algorithm?

a)

Patterns and trends used to solve a problem

b)

A set of step-by-step instructions to resolve a problem

c)

A programming language

7.

What is abstraction?

a)

Removal of certain details, keeping relevant the information

b)

Stores data in a program for retrieval

c)

Freedom from representing art

d)

Detects errors while program is running

8.

How can an algorithm be represented?

a)

As a flowchart only

b)

As pseudocode only

c)

As a flowchart or pseudocode

9.
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
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.

Which of the following are part of the Design development life cycle? Tick all that apply

a)

Testing

b)

Design

c)

Analysis

d)

Coding

12.

Which of the following methods are recognised methods used to design and construct computer related solutions?

a)

variables

b)

Structure diagrams

c)

flowcharts

d)

pseudocode

13.

A computer system can be decomposed into its component parts. One of the parts is Input. Identify the other two? ​ (a)   ​ (b)  

Choose from the below words
Process
Output
Fetch
CPU
Flowchart
Pseudocode
14.

Reorder the following pseudocode to show a routine for checking if a password has more than eitht characters

a)

IF LENGTH (Password) >08

b)

THEN Accept ?TRUE

c)

ELSE Accept ? FALSE

d)

ENDIF

1)
2)
3)
4)
15.

Which of the following codes is totalling?

(Note: The question mark in the code is another way of writing the pseudocode assignment in a variable. The code is also not indented correctly)

a)

Total ? 0

FOR Count ? 1 to ClassSize

INPUT MArk

Next Count

b)

PassCount

For Counter ? 1 to ClassSize

INPUT Mark

If Mark > 50

THEN

PassCount ? PassCount +1

ENDIF

NEXT COUNTER

16.

A Linear search inspects each name in a list in turn to see if the name matches the name that was input.

a)

TRUE

b)

FALSE

17.

Which of the following statements is correct when trying to determine the maximum, minimum and average values?

a)

To find the average all values must be totalled then divided by the number of values

b)

Always set the minimum value to the largest value possible.

c)

Always set the maximum value to the lowest value possible

d)

To find the maximum and minimum values every value must be checked

e)

All the other answers are correct

18.

Which of the following are validation methods

a)

Length check

b)

Range check

c)

Type Check

d)

Visual or screen check

19.

Which of the following are verification methods?

a)

Presence check

b)

Double Entry

c)

Format check

d)

Screen/visual check

20.

When testing data, which values would be considered to be´´boundary´´ values

a)

Test data that is accepted and the algorithm is expected to work

b)

Test data that is rejected by the algorithm as unsuitable

c)

One value is accepted and the other is rejected

d)

The largest and smallest values that normal data can take

21.

What is the purpose of a TRACE table?

a)

To store a record of all user activities

b)

To create a timeline of events

c)

To record the results of each step in an algorithm to test for errors

d)

To provide a visual representation of data

22.

It is known as ​​ (a)   when you ensure a number is positive

Choose from the below words
validation
Verification
neither
23.

Variables and constants refer to a data store containing a single value, identified by a meaningful name. Both can change change during the program. Both variables need to be declared before use.

a)

TRUE

b)

FALSE

24.

Which of these activities are examples of following an algorithm?

a)

Playing a game of chess

b)

Baking a cake

c)

Playing a piece of sheet music on the piano

d)

Following directions from Google Maps

25.

Which of these are valid reasons for using subprograms to structure a program? (select all that apply)

a)

Fewer lines of code

b)

Can test subprograms independently

c)

Avoids repetition of code

d)

Different programmers can work on different parts of the program

e)

Avoids need to use local variables

26.

Which of these are fundamental control structures in any computer program?

a)

branching

b)

sequence

c)

selection

d)

repetition

e)

iteration

27.

A structured approach to programming which involves breaking a large program down into a number of smaller sub-programs is called ...

a)

object orientation

b)

algorithm

c)

decomposition

d)

abstraction

28.

Which of these are valid methods of representing the steps of an algorithm? (select all that apply)

a)

Flowchart

b)

Pseudocode

c)

Program code

d)

English

29.

Which of these are valid reasons for using subprograms to structure a program? (select all that apply)

a)

Fewer lines of code

b)

Can test subprograms independently

c)

Avoids repetition of code

d)

Different programmers can work on different parts of the program

e)

Avoids need to use local variables

30.

Which of these are recognised techniques of Computational Thinking? (select all that apply)

a)

Debugging

b)

Decomposition

c)

Abstraction

d)

Pattern recognition

e)

Brute-force search

31.

Abstraction is a recognised technique of Computational Thinking. Which of these is the best definition of abstraction?

a)

Creating a set of logical steps that when followed achieve a particular task

b)

Breaking a problem down into several layers of smaller and simpler subproblems

c)

The process of removing or hiding unnecessary detail from a problem

d)

Exploiting the recurrence of patterns in data to make processing more efficient

32.

Which of these sorting algorithms is the most efficient?

a)

Merge sort

b)

Bubble sort

c)

Insertion sort

d)

Selection sort

33.

For which algorithm would it be best to use a conditional loop?

a)

Finding largest number in a list

b)

Calculating average of a list of numbers

c)

Counting occurrences of an item in a list

d)

Checking if an item is in a list

34.

For which algorithm would it be best to use an unconditional loop?

a)

Validating username and password

b)

Adding up numbers in a list

c)

Finding first occurrence of a number in a list

d)

Validating user input for date of birth

35.

What would the list [9, 6, 12, 7, 3, 16, 10] look like after one iteration of the Bubble sort algorithm (smallest to biggest)?

a)

[6, 9, 7, 3, 12, 10, 16]

b)

[3, 9, 6, 12, 7, 16, 10]

c)

[3, 6, 7, 9, 10, 12, 16]

d)

[9, 6, 12, 3, 7, 16, 10]

36.

Which of these algorithms is an example of a divide-and-conquer type algorithm?

a)

Bubble sort

b)

Binary search

c)

Linear search

d)

Count occurrences

37.

Which is the correct flowchart symbol for input/output?

a)
b)
c)
d)
38.

This is the main loop from an algorithm (shown in Python.) Which algorithm is it?

a)

LInear search

b)

BInary search

c)

Bubble sort

d)

Count occurrences

39.

This is the main loop from an algorithm (shown in Python.) Which algorithm is it?

a)

Linear search

b)

Binary search

c)

Bubble sort

d)

Merge sort

40.

This is the main loop from an algorithm (shown in Python.) Which algorithm is it?

a)

Linear search

b)

Binary search

c)

Bubble sort

d)

Merge sort

41.

This is the main loop from an algorithm (shown in Python.) Which algorithm is it?

a)

Linear search

b)

Binary search

c)

Find maximum

d)

Count occurrences

42.

A Linear search inspects each name in a list in turn to see if the name matches the name that was input.

a)

TRUE

b)

FALSE