Problem Decomposition with Divide and Conquer (OCR A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What is problem decomposition?
What is problem decomposition?
Breaking problems into smaller sub-problems
How many steps are in the divide and conquer strategy?
How many steps are in the divide and conquer strategy?
3
In Merge Sort, what happens in the 'combine' step?
In Merge Sort, what happens in the 'combine' step?
Merge two sorted halves into one array
What does parallel task execution involve?
What does parallel task execution involve?
Executing sub-tasks concurrently
What is a benefit of parallel execution?
What is a benefit of parallel execution?
Reduces overall time required
How does problem decomposition improve debugging?
How does problem decomposition improve debugging?
Smaller tasks are easier to test individually
What is the main purpose of divide and conquer?
What is the main purpose of divide and conquer?
Simplify by focusing on smaller parts
What problem arises from over-decomposition?
What problem arises from over-decomposition?
Solution becomes unnecessarily complex
Why is ignoring dependencies a common mistake?
Why is ignoring dependencies a common mistake?
Some tasks depend on others' results
How does Binary Search use divide and conquer?
How does Binary Search use divide and conquer?
Splits search space in half each step
In the weather data example, which tasks run in parallel?
In the weather data example, which tasks run in parallel?
Temperature, humidity, wind speed data
What is the final step when applying problem decomposition?
What is the final step when applying problem decomposition?
Identify parallel tasks