Important Questions and Answers for Class 11 Computer Science Chapter 4 Introduction to Problem Solving 2025-26

1. Multiple choice questions.

Q1. Which of the following best defines an algorithm?

• (a) Step-by-step method for solving a problem
• (b) A programming language
• (c) A type of computer
• (d) A computer game

Answer: (a) Step-by-step method for solving a problem.

Q2. Which is NOT a characteristic of a good algorithm?

• (a) Finiteness
• (b) Ambiguity
• (c) Input
• (d) Output

Answer: (b) Ambiguity.

Q3. What does GIGO stand for in the context of computers?

• (a) Good In Good Out
• (b) Garbage In Garbage Out
• (c) Go In Go Out
• (d) Get In Get Out

Answer: (b) Garbage In Garbage Out.

Q4. Which shape in a flowchart represents a decision?

• (a) Rectangle
• (b) Parallelogram
• (c) Diamond
• (d) Oval

Answer: (c) Diamond.

2. Very Short Answer (VSA).

Q1. Define problem solving in computer science.

Answer: Problem solving is the process of identifying a problem, developing an algorithm for it, and implementing that algorithm as a program on a computer.

Q2. What is pseudocode?

Answer: Pseudocode is a way to describe algorithms using simple, human-readable statements, not tied to any programming language, for easy understanding.

Q3. Name two common representations for algorithms.

Answer: The two common representations for algorithms are flowcharts and pseudocode.

Q4. State one benefit of using high-level languages.

Answer: High-level languages are portable and easier to write, read, and maintain than low-level languages.

Q5. What is the origin of the term 'Algorithm'?

Answer: The term 'Algorithm' is traced to the Persian mathematician Al-Khwarizmi, whose name was Latinized as 'Algorithmi'.

3. Short Answer Questions.

Q1. Explain the concept of decomposition in problem solving.

Answer: Decomposition involves breaking down a complex problem into smaller, simpler sub-problems, which can be solved individually. These solutions are then combined to address the main problem. This approach, often called 'divide and conquer', makes problem solving manageable and organized.

Q2. List any three characteristics of a good algorithm and explain each in one line.

Answer:

• Precision: Every step is clearly defined.
• Finiteness: The algorithm ends after a certain number of steps.
• Output: It generates a result for valid inputs.

Q3. What are the uses of flowcharts in algorithm representation?

Answer: Flowcharts provide a visual representation of algorithm steps, using symbols and arrows to show flow of control. They make logic clear, help detect errors, and are easy for others to understand and review.

Q4. Why is verification of algorithms important? Give a reason.

Answer: Verification ensures the algorithm behaves as required for different inputs, helping to identify errors or missing steps so that the final program produces correct and reliable results.

4. Long Answer Questions.

Q1. Discuss the steps involved in solving a problem using a computer, using a real-life example.

Answer: Solving a problem using a computer involves several steps. First, analyze and clearly understand the problem. Next, develop an algorithm that outlines the solution in a stepwise manner. Then, convert the algorithm into code using a programming language. The code is tested and debugged for errors. After full validation, it’s implemented and maintained in real-world use. For instance, online railway reservation: understanding booking needs, designing the algorithm, programming it, rigorously testing, and updating as requirements change.

1. Analyze the problem and identify requirements
2. Develop an algorithm
3. Translate into code (programming)
4. Test, debug, and verify
5. Maintain and update as needed

Q2. Compare time complexity and space complexity in context of algorithms and provide an example illustrating their importance.

Answer: Time complexity refers to how much computational time an algorithm takes, while space complexity is the amount of memory it uses. For example, finding if a number is prime: checking all divisors (higher time) versus checking up to its square root (lower time). Both factors help choose efficient algorithms, especially for large datasets.

1. Time complexity affects program speed
2. Space complexity affects required memory
3. Efficient algorithms save resources

4. True or False Questions.

Q1. A flowchart is a type of diagram used to represent algorithms visually.

Answer: True

Q2. The syntax of a programming language does not affect how a program runs.

Answer: False

Q3. The maintenance stage in software is never needed after the program is delivered to users.

Answer: False

Q4. Conditionals are used in algorithms to make decisions based on certain criteria.

Answer: True

5. Match the Following Questions.

Q1. Match the following algorithm concepts with their correct descriptions:

Answer: 1 - A, 2 - B, 3 - C

Q2. Match the pairs related to flowchart symbols:

Answer: 1 - A, 2 - B, 3 - C

Why Learning Problem Solving is Essential for Class 11 Computer Science?

Consistent practice of Introduction to Problem Solving Class 11 Questions and Answers develops strong foundations for coding and software design. Download topic-wise PDFs and detailed solutions to sharpen your analytical and computational skills for better results.

With these Important Questions for Class 11 Computer Science with answers PDF Download, you can prepare for every exam typology. Understand the difference between algorithms, flowcharts, and decomposition to tackle even complex questions confidently in CBSE board exams.

CBSE Class 11 Computer Science Chapter-wise Important Questions

Additional Study Materials for Class 11 Computer Science