Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Quiz on Computational Thinking

Total questions: 40

Worksheet time: 20mins

Name
Class
Date
1.

Computational thinking primarily focuses on:

a)

Memorizing facts

b)

Step-by-step problem solving

c)

Writing in natural language

d)

Random guessing

2.

Which of the following is NOT a feature of computational thinking?

a)

Abstraction

b)

Pattern recognition

c)

Trial-and-error guessing

d)

Decomposition

3.

Computational thinking is mainly applied in:

a)

Cooking recipes only

b)

Solving mathematical, scientific, and real-world problems

c)

Only computer programming

d)

Art and painting only

4.

Which of the following is a cornerstone of computational thinking?

a)

Debugging

b)

Abstraction

c)

Recursion

d)

Printing output

5.

Pattern recognition in computational thinking means:

a)

Ignoring differences

b)

Identifying similarities to simplify solutions

c)

Repeating the same program multiple times

d)

Guessing answers

6.

Breaking down a large task into smaller tasks is called:

a)

Decomposition

b)

Debugging

c)

Overloading

d)

Transformation

7.

Which of these is NOT a characteristic of a good algorithm?

a)

Finiteness

b)

Ambiguity

c)

Effectiveness

d)

Definiteness

8.

An algorithm must always:

a)

Run infinitely

b)

Have clear and unambiguous steps

c)

Give multiple answers

d)

Be written in C language only

9.

A characteristic of a deterministic algorithm is:

a)

Gives different outputs for the same input

b)

Always produces the same output for the same input

c)

Works without inputs

d)

Randomly generates answers

10.

A common problem-solving strategy in computer science is:

a)

Guessing

b)

Brute force, divide and conquer, greedy methods

c)

Sleeping until the answer appears

d)

None of these

11.

Which strategy involves trying all possible solutions until the right one is found?

a)

Divide and conquer

b)

Greedy method

c)

Brute force

d)

Dynamic programming

12.

In divide and conquer, problems are:

a)

Ignored

b)

Divided into smaller sub-problems

c)

Multiplied to increase difficulty

d)

Randomly solved

13.

Boolean logic is based on values:

a)

Numbers only

b)

True and False

c)

Characters only

d)

Complex numbers

14.

In Boolean algebra, the NOT operation:

a)

Returns the same value

b)

Inverts the value (True→False, False→True)

c)

Multiplies numbers

d)

Divides numbers

15.

Expression: (A AND B) is true only if:

a)

Both A and B are false

b)

At least one is true

c)

Both A and B are true

d)

None of these

16.

The OR operator returns true when:

a)

Both operands are false

b)

Both operands are true

c)

At least one operand is true

d)

It never returns true

17.

Which of the following is the correct truth table result for XOR?

a)

True only when inputs are equal

b)

True only when inputs differ

c)

Always false

d)

Always true

18.

Data organization refers to:

a)

Arranging data for easy access and processing

b)

Destroying data

c)

Printing data randomly

d)

Ignoring structure

19.

Which of the following is an example of linear data structure?

a)

Graph

b)

Array

c)

Tree

d)

Heap

20.

Non-linear data structures include:

a)

Lists

b)

Arrays

c)

Graphs and Trees

d)

Queues

21.

A variable is best described as:

a)

Fixed value

b)

Named storage location in memory

c)

Random number generator

d)

A type of loop

22.

Which of these is a valid variable name in most programming languages?

a)

123name

b)

total_sum

c)

break

d)

#amount

23.

The value stored in a variable can:

a)

Never be changed

b)

Be updated during program execution

c)

Only store numbers

d)

Only store characters

24.

A list is:

a)

Collection of unrelated data

b)

Ordered collection of elements

c)

Random storage of data

d)

Fixed only to numbers

25.

An array stores:

a)

Multiple values of same data type

b)

Only a single value

c)

Only characters

d)

Values of different types randomly

26.

Indexing in arrays generally starts from:

a)

-1

b)

0

c)

1

d)

Any random number

27.

The length of array [10, 20, 30, 40] is:

a)

2

b)

3

c)

4

d)

5

28.

Strings in programming are:

a)

Numbers only

b)

Sequences of characters

c)

Always Boolean

d)

Not data types

29.

In most programming languages, a string is enclosed in:

a)

Curly braces {}

b)

Single or double quotes

c)

Square brackets []

d)

Parentheses ()

30.

Which operation is valid for strings?

a)

Concatenation

b)

Division

c)

Modulus

d)

Exponentiation

31.

Which cornerstone of computational thinking is used when ignoring unnecessary details?

a)

Abstraction

b)

Pattern recognition

c)

Decomposition

d)

Debugging

32.

A well-defined algorithm must:

a)

Have multiple meanings for each step

b)

Always produce correct output in finite time

c)

Run infinitely for accuracy

d)

Be hardware-dependent only

33.

Which Boolean expression is equivalent to NOT(A OR B)?

a)

(NOT A) AND (NOT B)

b)

(NOT A) OR (NOT B)

c)

A AND B

d)

A OR B

34.

Problem-solving using past experiences to solve new problems relates to:

a)

Pattern recognition

b)

Brute force

c)

Recursion

d)

Randomization

35.

If x=5 and y=10, what is the result of (x0)?

a)

True

b)

False

c)

Error

d)

Null

36.

Which of the following is the most efficient way to organize a phone directory?

a)

Random list

b)

Sorted array or tree

c)

Storing in a single variable

d)

Ignoring duplicates

37.

What is the output of concatenating "Data" + "Science"?

a)

DataScience

b)

Error

c)

Data Science (with space)

d)

ScienceData

38.

Which of the following is a mutable data structure in Python?

a)

String

b)

List

c)

Tuple

d)

None

39.

Which operation accesses the 3rd element of an array arr?

a)

arr[2]

b)

arr[3]

c)

arr[1]

d)

arr[-1]

40.

Boolean logic was introduced by:

a)

George Boole

b)

Charles Babbage

c)

Alan Turing

d)

John von Neumann