Computer Science Hard css pms

Which algorithm technique divides a problem into smaller subproblems?

A Greedy
B Divide and Conquer
C Brute Force
D Backtracking

Correct Answer: Option B — Divide and Conquer

Explanation: Divide and Conquer breaks a problem into smaller parts, solves them independently, and combines results.

0 views Back to Computer Science

Related MCQs

Which OSI layer is responsible for end-to-end communication?

Click to view answer →

What is the full form of VPN?

Click to view answer →

Which of the following is NOT an operating system?

Click to view answer →

Which data structure is most suitable for implementing recursion?

Click to view answer →

Which algorithm is commonly used to find the shortest path in a weighted graph?

Click to view answer →