Established 2026 · Free Educational Resources for All

Computer & AI · Self Assessment

Practice Test: What Is an Algorithm?

A 100-mark paper covering "What Is an Algorithm? Thinking Like a Computer" — multiple choice, true/false, fill-in-the-blank, column matching, and short answer, all auto-graded instantly.

EDUSAMBAM Editorial Team · 45 questions · 100 marks · Instant self-assessment

Questions

100

Marks

Sections

100%

Auto-Graded

Section	Questions	Marks Each	Total
A — Multiple Choice	15	2	30
B — True / False	10	2	20
C — Fill in the Blank	10	2	20
D — Column Matching	5 pairs	2	10
E — Short Answer	5	4	20
Total	45	—	100

Fill-in-the-blank and short-answer questions are checked automatically against accepted answers — exact wording doesn't need to match, but the key term should be present.

0 of 45 answered

0/100

You scored 0%

Keep practicing

Section A — Multiple Choice

30 marks

15 questions · 2 marks each.

1.An algorithm is best described as:Basic2 pts

A. A random collection of numbers

B. A step-by-step set of instructions to solve a problem or complete a task

C. A type of computer hardware

D. A programming language

2.Which of these is an everyday example of an algorithm?Basic2 pts

A. A recipe with step-by-step cooking instructions

B. A photograph

C. A song with no lyrics

D. A blank page

3.Algorithms are important in computing because they:Basic2 pts

A. Provide computers with clear steps to follow to solve problems

B. Are only used by artists

C. Have no practical use

D. Replace the need for programming

4.A flowchart is often used to:Basic2 pts

A. Visually represent the steps of an algorithm

B. Store data permanently

C. Replace a keyboard

D. Power a computer

5.Pseudocode is:Basic2 pts

A. A simplified, informal way of writing out an algorithm's logic before coding it

B. A type of computer virus

C. A programming language itself

D. A hardware component

6.A "sequence" in an algorithm refers to:Basic2 pts

A. Steps carried out one after another in order

B. Repeating a step forever

C. Skipping all steps

D. Random step order

7."Selection" in an algorithm refers to:Basic2 pts

A. Making a decision that leads to different paths, like an if/else choice

B. Always doing the same thing

C. Ignoring all conditions

D. Deleting the algorithm

8."Iteration" (or a loop) in an algorithm refers to:Basic2 pts

A. Repeating a set of steps multiple times

B. Never repeating any step

C. Only running once and stopping

D. Skipping steps randomly

9.An efficient algorithm is one that:Basic2 pts

A. Solves a problem correctly using reasonable time and resources

B. Always takes the longest possible time

C. Ignores the correct answer

D. Uses unlimited resources with no concern for speed

10.Debugging an algorithm means:Basic2 pts

A. Finding and fixing errors in its logic or steps

B. Deleting the entire algorithm

C. Making it run slower on purpose

D. Ignoring all errors

11.A search algorithm is designed to:Basic2 pts

A. Find a specific item or piece of information within a data set

B. Only delete data

C. Only store images

D. Power a monitor

12.A sorting algorithm is designed to:Basic2 pts

A. Arrange data in a particular order, such as ascending or descending

B. Only find data

C. Erase data completely

D. Encrypt data only

13.Which of these best describes "thinking like a computer" when designing an algorithm?Basic2 pts

A. Breaking a problem into small, precise, unambiguous steps

B. Guessing randomly until it works

C. Skipping the planning stage entirely

D. Avoiding all logical structure

14.Algorithms can be written in different forms, including:Basic2 pts

A. Plain language, flowcharts, or pseudocode

B. Only binary code

C. Only images

D. Only spoken word

15.GPS navigation apps use algorithms to:Basic2 pts

A. Calculate the fastest or shortest route between locations

B. Play music

C. Take photographs

D. Charge the phone battery

Section B — True / False

20 marks

10 questions · 2 marks each.

16.An algorithm is a step-by-step set of instructions used to solve a problem.Intermediate2 pts

True

False

17.A recipe can be considered an everyday example of an algorithm.Intermediate2 pts

True

False

18.A flowchart is a visual way to represent the steps of an algorithm.Intermediate2 pts

True

False

19.Pseudocode is an official programming language that computers run directly.Intermediate2 pts

True

False

20.A sequence in an algorithm means steps are carried out one after another in order.Intermediate2 pts

True

False

21.Selection in an algorithm means always following the exact same path with no decisions.Intermediate2 pts

True

False

22.Iteration means repeating a set of steps multiple times.Intermediate2 pts

True

False

23.An efficient algorithm solves a problem correctly using reasonable time and resources.Intermediate2 pts

True

False

24.Debugging means finding and fixing errors in an algorithm's logic.Intermediate2 pts

True

False

25.Sorting algorithms are used to arrange data in a specific order.Intermediate2 pts

True

False

Section C — Fill in the Blank

20 marks

10 questions · 2 marks each. Type the missing word or term.

26.A step-by-step set of instructions to solve a problem is called an ______.Intermediate2 pts

27.A visual diagram used to represent the steps of an algorithm is called a ______.Intermediate2 pts

28.An informal way of writing out an algorithm's logic before coding it is called ______.Intermediate2 pts

29.Carrying out steps one after another in order is called ______ in an algorithm.Intermediate2 pts

30.Making a decision that leads to different paths in an algorithm is called ______.Intermediate2 pts

31.Repeating a set of steps multiple times in an algorithm is called ______, or a loop.Advanced2 pts

32.Finding and fixing errors in an algorithm's logic is called ______.Advanced2 pts

33.An algorithm designed to find a specific item in a data set is called a ______ algorithm.Advanced2 pts

34.An algorithm designed to arrange data in a specific order is called a ______ algorithm.Advanced2 pts

35.Breaking a problem into small, precise, unambiguous steps reflects "thinking like a ______."Advanced2 pts

Section D — Column Matching

10 marks

Use the ▲ ▼ buttons to reorder Column B until each row lines up with the correct term in Column A. 2 marks per correct pair.

36–40.Match each term to its correct definition.Advanced10 pts

Column A

Algorithm

Flowchart

Sequence

Selection

Iteration

Column B

Steps carried out one after another in order

A decision that leads to different paths

Repeating a set of steps multiple times

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

A visual diagram representing the steps of a process

Section E — Short Answer

20 marks

5 questions · 4 marks each. Answer in one or two sentences.

41.What is an algorithm, and why is it important in computing?Advanced4 pts

42.Give an everyday example of an algorithm and explain why it qualifies as one.Advanced4 pts

43.Explain the difference between sequence, selection, and iteration in an algorithm.Advanced4 pts

44.What does it mean to debug an algorithm?Advanced4 pts

45.Why is efficiency important when designing an algorithm?Advanced4 pts

← Back to What Is an Algorithm? Thinking Like a Computer