Scribd
Upload
3 views3 pages

Worksheet - Algorithmic Thinking (Objective)

The document is a worksheet on algorithmic thinking, consisting of multiple choice questions, true/false statements, and fill-in-the-blank exercises. It covers key concepts such as computational thinking, algorithms, loops, variables, and decision-making statements. The objective is to assess understanding of fundamental programming concepts and problem-solving techniques.

Uploaded by

masalopure
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Worksheet - Algorithmic Thinking (Objective)

The document is a worksheet on algorithmic thinking, consisting of multiple choice questions, true/false statements, and fill-in-the-blank exercises. It covers key concepts such as computational thinking, algorithms, loops, variables, and decision-making statements. The objective is to assess understanding of fundamental programming concepts and problem-solving techniques.

Uploaded by

masalopure
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

📘

Worksheet – Algorithmic Thinking


(Objective)
Part A: Multiple Choice Questions (MCQs)
Choose the correct option.

1 Computational Thinking helps to:


a) Memorize programs
b) Break complex problems into smaller parts
c) Draw flowcharts only
d) Use the internet

2 The step-by-step procedure to solve a problem is called:


a) Variable
b) Loop
c) Algorithm
d) Constant

3 Which stage focuses only on important information?


a) Decomposition
b) Pattern Recognition
c) Abstraction
d) Debugging

4 Which of the following is an artificial language?


a) Flowchart
b) Pseudocode
c) Assembly
d) Diagram

5 A variable is:
a) A value that cannot change
b) A loop
c) A value that can change
d) A condition

6 Which statement is used for decision making?


a) FOR
b) WHILE
c) IF–ELSE
d) PRINT

7 Which loop is guaranteed to run at least once?


a) WHILE
b) FOR
c) REPEAT–UNTIL
d) CASE

8 Which measures how fast an algorithm runs?


a) Space complexity
b) Time complexity
c) Abstraction
d) Decomposition

9 Nested conditional means:


a) A loop inside loop
b) An IF inside another IF
c) A variable inside constant
d) A flowchart

10 The Halting Problem states that:


a) All programs stop
b) No program stops
c) It is impossible to always determine if a program will stop
d) Loops never end

Part B: True / False


Write True or False.

1 An algorithm must follow steps in correct order.

2 Constants can change during program execution.

3 Pseudocode can be executed directly by a computer.

4 CASE statement is used for multiple selections.

5 A WHILE loop checks condition before executing.

6 Time complexity measures memory usage.

7 Decomposition means breaking a big problem into smaller parts.

8 A condition always results in True or False.

Part C: Fill in the Blanks


1 __________ is the process of breaking a complex problem into smaller parts.

2 __________ focuses on important information and ignores irrelevant details.

3 A __________ is a value that cannot change during program execution.


4 The process of repeating instructions is called __________.

5 BEGIN and END are used in __________.

6 Time and memory are used to measure __________ of an algorithm.

7 A loop inside another loop is called a __________ loop.

8 IF–ELSE statement is an example of __________ control structure.

You might also like