Problem Solving Strategies in Computing for Year 7: Interactive Quizzes

Question 1

Which problem-solving strategy involves breaking down a problem into smaller, more manageable pieces?

Accepted Answer

Divide-and-Conquer

Answer

Backtracking

Answer

Brute-Force

Answer

Hill climbing

Question 2

Which of the following is the first step in the divide-and-conquer strategy?

Accepted Answer

Break the problem into smaller subproblems

Answer

Solve the entire problem at once

Answer

Guess and check potential solutions

Answer

Use trial and error to find a solution

Question 3

Which of the following is NOT an advantage of the divide-and-conquer strategy?

Accepted Answer

Guarantee of finding the best solution

Answer

Breaking down complex problems

Answer

Potential for error reduction

Answer

Applicable to a range of problems

Question 4

Which problem-solving strategy involves trying out different possible solutions until one works?

Accepted Answer

Brute-Force

Answer

Divide-and-Conquer

Answer

Backtracking

Answer

Hill Climbing

Question 5

Which problem-solving strategy involves exploring different paths or solutions, and going back if a path doesn't work?

Accepted Answer

Backtracking

Answer

Divide-and-Conquer

Answer

Heuristic

Answer

Greedy

Question 6

Which of the following is a problem-solving strategy that involves exploring different paths and backtracking when necessary?

Accepted Answer

Backtracking

Answer

Divide-and-conquer

Answer

Brute force

Answer

Binary search

Question 7

A problem-solving technique that involves breaking down a complex problem into smaller, manageable subproblems is known as:

Accepted Answer

Divide-and-conquer

Answer

Backtracking

Answer

Binary search

Answer

Brute force

Question 8

Which of the following is a potential disadvantage of using the brute force strategy?

Accepted Answer

High computational cost

Answer

Inaccurate results

Answer

Limited applicability

Answer

Complex implementation

Question 9

In problem solving, what is the role of heuristics?

Accepted Answer

Providing approximate solutions

Answer

Guaranteeing optimal solutions

Answer

Eliminating incorrect solutions

Answer

Reducing computational complexity

Question 10

What is the first step in the divide-and-conquer strategy?

Accepted Answer

Dividing the problem into smaller subproblems

Answer

Solving the base case

Answer

Conquering the subproblems

Answer

Combining the solutions of the subproblems

Question 11

When using the divide-and-conquer strategy, what's the first step you should take?

Accepted Answer

Break the problem into smaller, easier parts

Answer

Find the solution to the smaller parts

Answer

Put the solutions together to solve the original problem

Question 12

In the divide-and-conquer problem-solving strategy, what is the first key step in solving a problem?

Accepted Answer

Breaking the problem into smaller subproblems

Answer

Identifying the base case

Answer

Solving the subproblems recursively

Question 13

Which of the following is a problem-solving strategy that involves breaking a problem into smaller, more manageable parts?

Accepted Answer

Divide-and-conquer

Answer

Linear search

Answer

Merge sort

Answer

Binary search

Question 14

What is the first step in the divide-and-conquer strategy?

Accepted Answer

Divide the problem into smaller parts

Answer

Solve the smaller parts

Answer

Combine the solutions to the smaller parts

Answer

Repeat steps 1-3 until the problem is solved

Question 15

Which of the following is NOT a step in the divide-and-conquer strategy?

Accepted Answer

Guess and check possible solutions

Answer

Divide the problem into smaller parts

Answer

Solve the smaller parts

Answer

Combine the solutions to the smaller parts

Question 16

What is the purpose of backtracking in problem-solving?

Accepted Answer

To explore all possible solutions to a problem

Answer

To find the optimal solution to a problem

Answer

To simplify a problem by breaking it into smaller parts

Answer

To guess and check different solutions

Question 17

Which of the following is NOT a disadvantage of using backtracking?

Accepted Answer

It is easy to implement

Answer

It can be inefficient for large problems

Answer

It is not suitable for all types of problems

Answer

It requires a lot of memory

Question 18

What is the first step in solving a complex problem in computing?

Accepted Answer

To break the problem into smaller parts and solve them one by one

Answer

To try different solutions randomly

Answer

To guess and check different solutions

Answer

To give up if you can't solve the problem immediately

Question 19

In the divide-and-conquer strategy, the problem is:

Accepted Answer

Broken down into smaller independent subproblems

Answer

Solved using a step-by-step iterative approach

Answer

Tried with different approaches without any logical order

Answer

Analysed to identify its root cause

Question 20

Which of the following is an advantage of the divide-and-conquer strategy?

Accepted Answer

It can efficiently solve complex problems by breaking them into smaller ones

Answer

It is guaranteed to find the most efficient solution for any problem

Answer

It does not require a clear understanding of the problem

Answer

It can be applied to any type of problem, regardless of its complexity

Question 21

In the backtracking strategy, the computer:

Accepted Answer

Systematically explores different solutions to a problem

Answer

Breaks down the problem into independent subproblems

Answer

Uses a fixed sequence of steps to find a solution

Answer

Analyses the problem to determine its inherent difficulty

Question 22

Which of the following is a limitation of the backtracking strategy?

Accepted Answer

It can be inefficient for large problems with numerous possible solutions

Answer

It is not suitable for solving all types of problems

Answer

It requires a deep understanding of the problem's underlying structure

Answer

It is always the most complex strategy to use

Question 23

Which of the following is NOT a good practice when solving computing problems?

Accepted Answer

Giving up easily when遇到 difficulties

Answer

Breaking down the problem into smaller manageable steps

Answer

Using a structured and logical approach to find a solution

Answer

Trying different approaches if one method doesn't work

Question 24

What is a key difference between backtracking and brute-force search?

Accepted Answer

Backtracking explores fewer solutions.

Answer

Backtracking is always guaranteed to find a solution.

Answer

Brute-force search is more efficient than backtracking.

Answer

Backtracking can only be used on specific types of problems.

Question 25

What is the primary role of heuristics in problem-solving?

Accepted Answer

To improve the efficiency of a problem-solving strategy

Answer

To guarantee the correctness of a solution

Answer

To replace the need for a problem-solving strategy

Answer

To make problem-solving more challenging

Question 26

Which of the following is NOT a common obstacle in problem-solving?

Accepted Answer

Abundance of information

Answer

Lack of knowledge

Answer

Cognitive biases

Answer

Time constraints

Question 27

Which problem-solving strategy involves breaking down a complex problem into smaller, more manageable ones?

Accepted Answer

Divide and conquer

Answer

Backtracking

Answer

Brute force

Answer

Breadth-first search

Question 28

What is a key benefit of using the divide-and-conquer strategy?

Accepted Answer

Reduces the complexity of the problem

Answer

Guarantees an optimal solution

Answer

Can be applied to any type of problem

Answer

Is easy to implement

Question 29

Which of the following is not considered a problem-solving strategy?

Accepted Answer

Random search

Answer

Guess and check

Answer

Divide and conquer

Answer

Dynamic programming

Question 30

For a problem with multiple possible solutions, which problem-solving strategy is most suitable?

Accepted Answer

Backtracking

Answer

Brute force

Answer

Greedy algorithm

Answer

Divide and conquer

Question 31

What is a potential challenge when using the divide-and-conquer strategy?

Accepted Answer

It can be difficult to use for very large problems.

Answer

It always finds the best solution.

Answer

It is easy to understand and use.

Answer

It works well for all types of problems.

Question 32

Which real-life problem-solving scenario would be most suitable for using the backtracking strategy?

Accepted Answer

Finding the quickest route through a complex building to a particular room

Answer

Arranging your favorite foods in order of preference

Answer

Locating a specific contact in your phone's address book

Question 33

Which of the following best describes the key difference between divide-and-conquer and backtracking problem-solving strategies in computing?

Accepted Answer

Divide-and-conquer breaks a problem into smaller parts, while backtracking tries all possible solutions.

Answer

Both strategies are equally effective for all types of problems.

Answer

Divide-and-conquer is only useful for problems with a recursive structure.

Answer

Backtracking is simpler than divide-and-conquer.

Question 34

Which of the following is NOT a problem-solving strategy taught in this unit?

Accepted Answer

Trial and error

Answer

Divide-and-conquer

Answer

Backtracking

Question 35

How does recursion differ from iteration in problem-solving?

Accepted Answer

Recursion divides a problem into smaller versions, while iteration solves it step-by-step.

Answer

Recursion uses a stack data structure, while iteration uses a queue.

Answer

Recursion is always more efficient than iteration.

Answer

Iteration is only used to solve problems that involve repeating a set of steps.

Question 36

When would backtracking be a better choice than brute force?

Accepted Answer

Finding the shortest path in a maze

Answer

Finding the largest number in an array

Answer

Sorting a list of numbers

Answer

Solving a quadratic equation

Question 37

When faced with a complex problem, which strategy breaks it down into smaller, manageable chunks?

Accepted Answer

Divide and conquer

Answer

Linear search

Answer

Backtracking

Answer

Brute force

Question 38

What is the purpose of using backtracking in problem-solving?

Accepted Answer

To consider different solutions and identify the best one

Answer

To simplify complex problems

Answer

To eliminate incorrect options quickly

Question 39

When solving a problem, which step should NOT be included in the process?

Accepted Answer

Putting the solution into action without testing it

Answer

Analyzing the problem

Answer

Developing a solution

Question 40

What do we call a technique that offers a quick but potentially non-optimal solution?

Accepted Answer

Heuristic technique

Answer

Divide-and-conquer strategy

Answer

Brute force method

Question 41

What is the main disadvantage of using a brute force approach?

Accepted Answer

It can be very slow and inefficient for large problems

Answer

It may not always find the optimal solution

Answer

It is difficult to implement correctly

Question 42

When selecting a problem-solving technique, which factor is most important to consider?

Accepted Answer

The size and complexity of the problem

Answer

The programmer's personal preferences

Answer

The time available to solve the problem

Answer

The programming language being used

Question 43

What is an advantage of using a backtracking algorithm?

Accepted Answer

It can explore all possible solutions to a problem

Answer

It is the most efficient approach in all cases

Answer

It guarantees finding the best solution

Answer

It is simpler to implement than other algorithms

Question 44

What is the key difference between a heuristic and an algorithm?

Accepted Answer

A heuristic provides an approximate solution, while an algorithm guarantees an optimal solution

Answer

Algorithms require less computation time than heuristics

Answer

Heuristics are more complex than algorithms

Question 45

Which of these is NOT a common problem-solving strategy used in computing?

Accepted Answer

Memorization

Answer

Backtracking

Answer

Brute force

Answer

Divide-and-conquer

Question 46

You want to solve a problem by splitting it into smaller, easier parts. Which strategy is best for this?

Accepted Answer

Divide-and-conquer

Answer

Backtracking

Answer

Brute force

Answer

Memorization

Question 47

What problem-solving strategy tries every single possible solution until it finds the right one?

Accepted Answer

Brute force

Answer

Divide-and-conquer

Answer

Memorization

Answer

Backtracking

Question 48

Which strategy tries different possibilities, and goes back (or 'tracks back') if something doesn't work?

Accepted Answer

Backtracking

Answer

Memorization

Answer

Divide-and-conquer

Answer

Brute force

Question 49

When would you use 'divide-and-conquer' to solve a problem?

Accepted Answer

When the problem can be broken down into smaller, independent parts.

Answer

When there are only a few possible answers.

Answer

When the problem is really complicated.

Question 50

What's the main advantage of using backtracking to solve problems?

Accepted Answer

It lets you try out all possible solutions in an organized way.

Answer

It always finds the best possible solution.

Answer

It's the fastest strategy for all kinds of problems.

Question 51

What's a downside of using brute force to solve problems?

Accepted Answer

It can take a really long time and use lots of computing power.

Answer

It might not find a solution at all.

Answer

It only works for easy problems.

Answer

It's hard to understand and use.

Question 52

When is memorization a good problem-solving strategy?

Accepted Answer

When the problem is simple and you can easily remember the answer.

Answer

When the problem is complicated and needs lots of calculations.

Answer

When there are many different possible answers.

Question 53

Which of these is NOT something you should think about when choosing a problem-solving strategy?

Accepted Answer

How good the solution looks

Answer

What resources you have available

Answer

How big the problem is

Answer

How much time you have

Question 54

What do we call breaking a problem down into smaller, easier pieces?

Accepted Answer

Decomposition

Answer

Simplification

Answer

Generalization

Answer

Abstraction