wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

grade 6 week 3

Total questions: 51

Worksheet time: 26mins

Name
Class
Date
1.

What is an algorithm?

a)

Error in a program

b)

Image of code

c)

Step-by-step method to solve a problem

d)

Type of programming error

2.

Can one problem be solved in different ways using different algorithms?

a)

No

b)

Yes

c)

Only in mathematics

d)

Only in games

3.

What do we call different methods to solve the same task?

a)

Bugs

b)

Function

c)

Algorithm

d)

Error

4.

Which problem can have multiple solutions?

a)

Sorting numbers

b)

Typing a word

c)

Printing a message

d)

Declaring a variable

5.

Why do we use different algorithms to solve the same problem?

a)

For fun

b)

To confuse the computer

c)

Because some are faster or simpler

d)

To make mistakes

6.

Which of the following is an example of solving a problem in a different way?

a)

Adding using a calculator or your fingers

b)

Typing faster

c)

Writing your name

d)

Charging your phone

7.

Which of the following best describes an algorithm?

a)

A collection of images

b)

A step-by-step process

c)

Program errors

d)

Shortcut keys

8.

What is one benefit of comparing different algorithms?

a)

Making your code longer

b)

Seeing which one crashes first

c)

Choosing the most efficient solution

d)

Avoiding learning new code

9.

What does it mean if an algorithm is more efficient?

a)

Harder to understand

b)

Uses fewer steps

c)

Crashes faster

d)

Takes more time

10.

Which one shows different ways to sort numbers?

a)

Bubble sort and selection sort

b)

Input and output

c)

Loop and string

d)

Print and print

11.

Can two students write different algorithms that correctly solve the same problem?

a)

No

b)

Yes

c)

Only if they use the same variables

d)

Only with the help of a teacher

12.

Why might we prefer one algorithm over another?

a)

Longer

b)

Uses more variables

c)

Easier to understand or runs faster

d)

Looks complicated

13.

Two algorithms yield correct results. What can we say about them?

a)

Only one is valid

b)

Both are wrong

c)

Both are correct

d)

They must be exactly the same

14.

Is it okay if your friend writes an algorithm differently than you?

a)

No

b)

Only if you copy it

c)

Yes, as long as it works

d)

Only if they use Python

15.

What does it mean to compare algorithms?

a)

Finding out which has more errors

b)

Seeing which gives incorrect output

c)

Checking which works well

d)

Running both at the same time

16.

Which task can have different algorithms?

a)

Finding the largest number

b)

Typing your name

c)

Turning on the computer

d)

Writing 'Hello'

17.

What are two different ways to find the largest number?

a)

Comparing one by one or sorting all the numbers

b)

Asking a friend or guessing

c)

Input and output

d)

Adding them

18.

You want to sort numbers from smallest to largest. Which algorithm might you use?

a)

Bubble sort or selection sort

b)

Input and print

c)

Add and subtract

d)

Copy and paste

19.

You can find the missing number in a list by:

a)

Guessing

b)

Looking one by one or using math

c)

Printing it

d)

Deleting it

20.

If two students use different codes but get the same output, what does it indicate?

a)

One of them is wrong

b)

The code is broken

c)

Both solutions work

d)

Copying occurred

21.

What is meant by 'debugging'?

a)

Fixing problems in algorithms

b)

Making code longer

c)

Skipping instructions

d)

Using bugs

22.

Which problem has many possible solutions?

a)

Sorting names

b)

Typing

c)

Turning off the fan

d)

Saving a file

23.

Which of the following is a sign of a good algorithm?

a)

Confusing steps

b)

Easy to follow and correct

c)

Very long code

d)

Not using variables

24.

If one algorithm is shorter and gives the same result, what is it called?

a)

Bug

b)

Error

c)

More efficient algorithm

d)

Incorrect method

25.

Which of the following is not a type of algorithm?

a)

Bubble sort

b)

Linear search

c)

Input()

d)

Binary search

26.

Which of the following is not a type of algorithm?

a)

Bubble sort

b)

Linear search

c)

Input()

d)

Binary search

27.

If Algorithm A uses 10 steps and B uses 5 steps, which one is likely better?

a)

A

b)

B

c)

Neither

d)

It depends on the length

28.

Why might we choose a longer algorithm?

a)

Because it looks cool

b)

Because it is easier to understand

c)

Because it is slower

d)

Because it is messy

29.

What can happen if the algorithm is incorrect?

a)

Runs faster

b)

Gives incorrect output

c)

Prints your name

d)

Always passes

30.

Can different programming languages be used to solve the same problem?

a)

No

b)

Only Python

c)

Yes

d)

Only in C++

31.

Which of these is NOT a reason to compare algorithms?

a)

To find bugs

b)

To choose the best one

c)

To see who wrote it

d)

To make improvements

32.

Which task can have multiple algorithms?

a)

Finding even numbers

b)

Turning off the monitor

c)

Opening a notebook

d)

Typing an email

33.

Why do we care about the number of steps in an algorithm?

a)

Shorter is often faster

b)

We like long code

c)

Steps are not important

d)

To make it difficult

34.

What does 'step by step' mean in an algorithm?

a)

Random

b)

Mixed

c)

Ordered instructions

d)

Printed output

35.

Which algorithm is faster for small data sets:

a)

Bubble sort

b)

Selection sort

c)

None

d)

All the same

36.

If your algorithm works but is too slow, what can you do?

a)

Stop coding

b)

Just leave it

c)

Try a different algorithm

d)

Rename variables

37.

If two algorithms are functional, how do we know which one is better?

a)

Flip a coin

b)

Compare performance

c)

Choose randomly

d)

Use both together

38.

Can algorithms be tested with sample input?

a)

No

b)

Yes

c)

Only in Java

d)

Not necessary

39.

What do we learn by writing different algorithms?

a)

Code is boring

b)

There is only one answer

c)

Problem solving has many paths

d)

Coding is copying

40.

Why might a student's algorithm be easier to understand than another's?

a)

They use longer names

b)

They follow clean steps

c)

They type quickly

d)

They print a lot

41.

What does 'optimizing an algorithm' mean?

a)

Making it look better

b)

Making it faster and better

c)

Adding more lines

d)

Changing the language

42.

Two students wrote code to check for even numbers. One used % 2, while the other used a loop. Is this okay?

a)

No, only one is correct

b)

Yes, both can be valid

c)

Loop is wrong

d)

% cannot be used

43.

Which one shows the same problem with a different approach?

a)

Adding numbers manually or using sum()

b)

Printing or input

c)

Opening or closing

d)

Copying and pasting

44.

Can different algorithms produce the same result at different speeds?

a)

No

b)

Yes

c)

Only in games

d)

If copied

45.

Can visuals like flowcharts represent different solutions to the same problem?

a)

Yes

b)

No

c)

Only text

d)

Only code

46.

If your teacher assigns a task and your friend completes it in a different way, what should you do?

a)

Tell them they are wrong

b)

Compare and learn

c)

Report

d)

Ignore

47.

Why might someone choose a simpler algorithm over a faster one?

a)

For readability

b)

To make mistakes

c)

To confuse

d)

To fail

48.

Which task has only one solution?

a)

Turning on a switch

b)

Finding the maximum of 3 numbers

c)

Multiplying numbers

d)

None of the above

49.

How do we know if an algorithm works correctly?

a)

Ask a friend

b)

Test with input

c)

Guess

d)

Change randomly

50.

What is a common way to test several algorithms?

a)

Print all of them

b)

Use the same input

c)

Change the language

d)

Run without saving

51.

Apa yang bisa kita pelajari dengan membandingkan beberapa algoritma?

a)

Tidak ada

b)

Jalur berbeda ke solusi yang sama

c)

Semua kode salah

d)

Lebih banyak bug muncul