HomeSubjectsUniversityBlogAbout

Introduction to Problem Solving

Topic in Problem Solving & Analytical Skills

210 total MCQsShowing 30 with explanations10 Easy10 Medium10 Hard
Start Timed Quiz on Introduction to Problem SolvingBack to Problem Solving & Analytical Skills

About This Topic

Problem solving is the structured process of moving from an undesired current state to a goal state by defining the gap and choosing actions to close it. Questions here start with the classic step sequence of understand, plan, execute and review, then move to strategies such as generate-and-test, means-ends analysis, working backwards and trial and error. Expect items that contrast well-defined and ill-defined problems, explain how restating or decomposing a vague problem makes it tractable, and probe ideas like metacognition, heuristics versus algorithms, functional fixedness and problem isomorphism, where two problems share the same underlying structure.

Below are 30 practice questions from a pool of 210 Introduction to Problem Solving MCQs, one of 16 topics in Problem Solving & Analytical Skills. Each shows the correct answer with an explanation; when you are ready, take a timed quiz to test recall under exam conditions.

Practice Questions

Each question below shows the correct answer with a full explanation. Use these to build conceptual understanding before attempting a timed quiz.

Introduction to Problem SolvingEasy

Q1. What is the first step in problem solving?

  1. A.Testing the solution for correctness
  2. B.Understanding the problem thoroughly✓ Correct
  3. C.Deploying the application to production
  4. D.Writing code to implement a solution

Explanation

Understanding the problem is always the first and most critical step before attempting any solution.

Report an error in this question

Introduction to Problem SolvingEasy

Q2. Which best describes problem solving in CS?

  1. A.Memorizing algorithms from a textbook
  2. B.A systematic approach to finding solutions✓ Correct
  3. C.Copying solutions from existing projects
  4. D.Writing programs without any planning

Explanation

Problem solving in CS is a systematic approach involving understanding, planning, implementing, and evaluating.

Report an error in this question

Introduction to Problem SolvingEasy

Q3. What does decomposition mean in problem solving?

  1. A.Making a problem increasingly more complex
  2. B.Ignoring certain parts of the problem
  3. C.Combining multiple problems into one task
  4. D.Breaking a problem into smaller sub-problems✓ Correct

Explanation

Decomposition breaks down a complex problem into smaller, manageable sub-problems.

Report an error in this question

Introduction to Problem SolvingEasy

Q4. Which skill is most essential for a problem solver?

  1. A.Graphic design expertise
  2. B.Data entry proficiency
  3. C.Analytical thinking skills✓ Correct
  4. D.Speed typing on a keyboard

Explanation

Analytical thinking allows breaking down problems, identifying patterns, and developing logical solutions.

Report an error in this question

Introduction to Problem SolvingEasy

Q5. What is an algorithm?

  1. A.A database management system design
  2. B.A step-by-step procedure to solve a problem✓ Correct
  3. C.A specific programming language syntax
  4. D.A type of computer hardware component

Explanation

An algorithm is a well-defined, step-by-step procedure to solve a specific problem.

Report an error in this question

Introduction to Problem SolvingEasy

Q6. Which is NOT a phase of problem solving?

  1. A.Devising a plan for the solution
  2. B.Procrastinating and delaying action✓ Correct
  3. C.Looking back and evaluating results
  4. D.Understanding the problem clearly

Explanation

Polya's phases are understanding, planning, carrying out the plan, and looking back.

Report an error in this question

Introduction to Problem SolvingEasy

Q7. What is the purpose of brainstorming?

  1. A.To eliminate all ideas immediately
  2. B.To finalize the code right away
  3. C.To test the program for errors
  4. D.To generate multiple possible solutions✓ Correct

Explanation

Brainstorming generates multiple possible solutions before selecting the best approach.

Report an error in this question

Introduction to Problem SolvingEasy

Q8. Who introduced the four-step problem solving process?

  1. A.George Polya✓ Correct
  2. B.Alan Turing
  3. C.Donald Knuth
  4. D.Ada Lovelace

Explanation

George Polya introduced it in 'How to Solve It' (1945).

Report an error in this question

Introduction to Problem SolvingEasy

Q9. What is a heuristic?

  1. A.A specific programming language tool
  2. B.A guaranteed optimal solution method
  3. C.A type of programming syntax error
  4. D.A practical approach that is sufficient✓ Correct

Explanation

A heuristic provides a good-enough solution when optimal is impractical.

Report an error in this question

Introduction to Problem SolvingEasy

Q10. Which approach solves a simpler version first?

  1. A.Randomization approach
  2. B.Elimination technique
  3. C.Brute force method
  4. D.Simplification strategy✓ Correct

Explanation

Simplification solves a simpler version then extends to the full problem.

Report an error in this question

Introduction to Problem SolvingMedium

Q11. In Polya's method, what comes after devising a plan?

  1. A.Looking back at the work
  2. B.Understanding the problem
  3. C.Carrying out the plan✓ Correct
  4. D.Restating the problem

Explanation

Steps: Understand, Devise plan, Carry out plan, Look back.

Report an error in this question

Introduction to Problem SolvingMedium

Q12. What is divide and conquer?

  1. A.Only solving the first half of the problem
  2. B.Solving the problem without breaking it down
  3. C.Ignoring the most difficult parts of a task
  4. D.Dividing into smaller independent sub-problems✓ Correct

Explanation

Divide and conquer splits, solves recursively, and combines results.

Report an error in this question

Introduction to Problem SolvingMedium

Q13. Which strategy works backward from the goal?

  1. A.Trial and error method
  2. B.Forward chaining approach
  3. C.Brute force technique
  4. D.Working backward strategy✓ Correct

Explanation

Working backward determines steps from goal to initial state.

Report an error in this question

Introduction to Problem SolvingMedium

Q14. What distinguishes computational thinking?

  1. A.It cannot involve algorithmic processes
  2. B.It requires absolutely no human input
  3. C.It is applicable only to mathematics
  4. D.Formulating problems for computer solutions✓ Correct

Explanation

Computational thinking formulates problems for computer-based solutions.

Report an error in this question

Introduction to Problem SolvingMedium

Q15. What is abstraction in problem solving?

  1. A.Ignoring the problem entirely to move on
  2. B.Removing unnecessary details to focus✓ Correct
  3. C.Adding more details to the problem
  4. D.Making the problem significantly harder

Explanation

Abstraction filters out unnecessary details.

Report an error in this question

Introduction to Problem SolvingMedium

Q16. Which uses previously learned solutions?

  1. A.Analogical reasoning method✓ Correct
  2. B.Brute force technique
  3. C.Random guessing approach
  4. D.Creative problem solving

Explanation

Analogical reasoning adapts solutions from similar past problems.

Report an error in this question

Introduction to Problem SolvingMedium

Q17. What is a constraint?

  1. A.An algorithm type to implement
  2. B.A ready-made solution to use
  3. C.An optional feature to consider
  4. D.A limitation that must be satisfied✓ Correct

Explanation

Constraints are limitations any valid solution must satisfy.

Report an error in this question

Introduction to Problem SolvingMedium

Q18. What role does evaluation play?

  1. A.Assesses whether the solution is correct✓ Correct
  2. B.It only checks for syntax errors
  3. C.It fully replaces all testing
  4. D.It is completely unnecessary

Explanation

Evaluation assesses correctness and efficiency.

Report an error in this question

Introduction to Problem SolvingMedium

Q19. Which technique tries all possible solutions?

  1. A.Dynamic programming
  2. B.Greedy algorithm
  3. C.Heuristic approach
  4. D.Brute force search✓ Correct

Explanation

Brute force tries all possible solutions.

Report an error in this question

Introduction to Problem SolvingMedium

Q20. What is iterative refinement?

  1. A.Repeatedly improving through cycles✓ Correct
  2. B.Copying work from other sources
  3. C.Deleting the solution entirely
  4. D.Solving the problem only once

Explanation

Iterative refinement repeatedly improves solutions.

Report an error in this question

Introduction to Problem SolvingHard

Q21. Shortest path with negative edges (no negative cycles)?

  1. A.Simple BFS traversal
  2. B.Bellman-Ford algorithm✓ Correct
  3. C.Dijkstra's algorithm
  4. D.DFS with backtracking

Explanation

Bellman-Ford handles negative edges; Dijkstra's requires non-negative.

Report an error in this question

Introduction to Problem SolvingHard

Q22. Which paradigm makes locally optimal choices at each step?

  1. A.Dynamic programming approach
  2. B.Backtracking technique
  3. C.Divide and conquer method
  4. D.Greedy algorithm approach✓ Correct

Explanation

Greedy makes locally optimal choices hoping for global optimum.

Report an error in this question

Introduction to Problem SolvingHard

Q23. What is reduction in problem solving?

  1. A.Reducing the number of variables used
  2. B.Transforming into another known problem✓ Correct
  3. C.Simplifying the program output format
  4. D.Making smaller by removing input data

Explanation

Reduction transforms a problem into another whose solution is known.

Report an error in this question

Introduction to Problem SolvingHard

Q24. What characterizes an NP-hard problem?

  1. A.Has absolutely no solution at all
  2. B.At least as hard as hardest NP problems✓ Correct
  3. C.Solvable easily in polynomial time
  4. D.Always unsolvable by any algorithm

Explanation

NP-hard: at least as hard as the hardest problems in NP.

Report an error in this question

Introduction to Problem SolvingHard

Q25. What is optimal substructure?

  1. A.Only greedy algorithms work on it
  2. B.Problem cannot be decomposed at all
  3. C.Sub-problems are fully independent
  4. D.Optimal solution uses optimal sub-solutions✓ Correct

Explanation

Enables dynamic programming approaches.

Report an error in this question

Introduction to Problem SolvingHard

Q26. Which concept stores sub-problem solutions?

  1. A.Iterative computation
  2. B.Memoization technique✓ Correct
  3. C.Simple recursion method
  4. D.Compilation process

Explanation

Memoization caches results to avoid redundant computation.

Report an error in this question

Introduction to Problem SolvingHard

Q27. Overlapping sub-problems + optimal substructure = which paradigm?

  1. A.Linear search method
  2. B.Brute force search
  3. C.Dynamic programming✓ Correct
  4. D.Simple recursion only

Explanation

DP is ideal with both properties.

Report an error in this question

Introduction to Problem SolvingHard

Q28. Decidable vs undecidable?

  1. A.An algorithm solves every decidable instance✓ Correct
  2. B.Decidable problems cannot use any recursion
  3. C.Undecidable problems have no instances at all
  4. D.Decidable problems are always harder to solve

Explanation

Decidable problems have algorithms that always terminate correctly.

Report an error in this question

Introduction to Problem SolvingHard

Q29. What is state space search?

  1. A.Querying a database for records
  2. B.Allocating memory for data storage
  3. C.Searching through files on a disk
  4. D.Exploring all states to find a path✓ Correct

Explanation

Explores all states to find a path from initial to goal.

Report an error in this question

Introduction to Problem SolvingHard

Q30. Which problem is undecidable?

  1. A.Binary search tree lookup
  2. B.Finding the shortest path
  3. C.Sorting a list of elements
  4. D.The Halting Problem itself✓ Correct

Explanation

The Halting Problem is proven undecidable by Turing.

Report an error in this question

More Problem Solving & Analytical Skills Topics

Problem Understanding & Analysis

Practice MCQs with explanations

Logical Reasoning Fundamentals

Practice MCQs with explanations

Algorithms & Flow Control

Practice MCQs with explanations

Data Representation & Abstraction

Practice MCQs with explanations

Pattern Recognition & Generalization

Practice MCQs with explanations

Mathematical & Quantitative Reasoning

Practice MCQs with explanations

Ready to test yourself on Introduction to Problem Solving?

Take a timed quiz drawn from 210+ questions on this topic. No signup required — your progress saves in your browser.

Start Introduction to Problem Solving Quiz