wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

computer science

Total questions: 22

Worksheet time: 12mins

Name
Class
Date
1.
What is an Algorithm?
a)
A chart showing the flow of a series of events
b)
Step-by-step instructions used to solve a problem
c)
A decision arrived at by following instructions
d)
A computer program that follows a chart
2.
Which type of sort algorithm is this?
a)
Bubble
b)
Merge
c)
Insertion
3.
Which of these is NOT a Sort algorithm
a)
Binary
b)
Merge
c)
Bubble
d)
Insertion
4.

Which of the following best describes abstraction?

a)

Removing all of the unimportant bits of a problem.

b)

Breaking the problem down into manageable chunks.

c)

A logical way of getting from the problem to the solution.

5.

What is this symbol used for when making a flow diagram?

a)

Decision

b)

Process

c)

Input/output

6.

Which of the following is a searching algorithm used by computer systems?

a)

Linear search

b)

Bubble search

c)

Open search

7.

If an algorithm is complicated it is easy to follow?

a)

TRUE

b)

FALSE

8.
Which sorting algorithm may make multiple swaps per pass?
a)
Bubble Sort
b)
Selection Sort
c)
Insertion Sort
9.

In a Flowchart, what does this symbol mean?

a)

Start/End

b)

Process

c)

Data Input

d)

Choice

10.

Flowcharts allow us to work through a problem without having to worry about the unnecessary details, what is this called?

a)

Algorithm

b)

Abstraction

c)

Decomposition

d)

Pattern Recognition

11.

Which of these is an advantage of the binary search method?

a)

Doesn't require data to be put into order.

b)

Can quickly search small amounts of data, compared to linear search.

c)

Can quickly search through large amounts of data, compared to linear search.

d)

Can easily understand different character types.

12.
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
13.
Which of the following is not a component of computational thinking?
a)
Abstraction
b)
Typing
c)
Decomposition
d)
Algorithmic thinking
14.
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
15.

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

16.
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.
17.
What does this shape represent in flowchart?
a)
Start/Stop
b)
Decision
c)
Process
d)
Input/Output
18.

Which type of error will not allow the program to run?

a)

Logic

b)

Semantic

c)

Run-time

d)

Syntax

19.

What data type would you use to represent 2 states?

a)

String

b)

Character

c)

Integer

d)

Boolean

20.

What is the name of the algorithm shown?

a)

Binary

b)

Linear

c)

Merge

d)

Bubble

21.

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.

22.

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