2 Marks Questions and Answers
1. Define an algorithm.
An algorithm is a finite step-by-step procedure to solve a problem or perform a computation.
2. What is pseudocode?
Pseudocode is a simplified, human-readable description of an algorithm that uses plain language
mixed with programming-like structure.
3. Explain the term 'flowchart.'
A flowchart is a diagrammatic representation of an algorithm using symbols to show the sequence
of steps.
4. What are conditionals in programming?
Conditionals are decision-making statements (like if-else) that execute different actions based on
whether a condition is true or false.
5. What is the purpose of a flowchart?
The purpose is to visually represent the logic of an algorithm, making it easier to understand,
analyze, and debug.
6. Describe the term 'sequence' in the context of algorithms.
Sequence refers to executing instructions in the exact order they are written, step by step.
7. What does iterative mean in algorithm design?
Iterative means repeating a set of steps multiple times until a condition is met, usually implemented
with loops.
8. Why is it important to verify an algorithm?
Verification ensures the algorithm produces correct results, works for all cases, and meets the
problem requirements.
9. What is a loop in programming?
A loop is a control structure that repeats a block of code as long as a specified condition is true.
10. What is the significance of decision making in algorithms?
Decision making allows algorithms to choose different paths of execution based on conditions,
making them flexible.
11. Write pseudocode to add two numbers.
Start
Input A, B
Sum ← A + B
Output Sum
End
12. Define 'space complexity' in algorithm analysis.
Space complexity is the amount of memory an algorithm uses during execution, including input,
variables, and auxiliary storage.
13. Define 'time complexity' in algorithm analysis.
Time complexity is the measure of the amount of time an algorithm takes to complete based on the
input size.
14. What are the components of a flowchart?
Common components are: Oval (Start/End), Rectangle (Process), Diamond (Decision),
Parallelogram (Input/Output), Arrows (Flow).
15. Explain the difference between pseudocode and a flowchart.
Pseudocode is a textual representation of an algorithm, while a flowchart is a graphical
representation using symbols.
16. What is an Armstrong number?
A number is Armstrong if the sum of its digits each raised to the power of the number of digits
equals the number itself. (e.g., 153 = 1³+5³+3³).
17. Describe the term 'branching' in algorithms.
Branching refers to the decision-making process where the control flow splits into different paths
based on conditions.
18. What is a single-digit number algorithm?
It is an algorithm that processes or performs operations on single-digit numbers (0–9).
19. Explain the term 'aggregate marks.'
Aggregate marks refer to the total marks obtained by summing up the scores from different subjects
or components.
20. What is the role of an algorithm in problem-solving?
An algorithm provides a clear, systematic, and efficient method to solve problems accurately and
step by step.