Which strategy solves problems by solving subproblems and combining th — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 2: Fundamental Algorithmic Strategies

20242m

Which strategy solves problems by solving subproblems and combining their solutions?
(i) Brute Force
(ii) Greedy
(iii) Dynamic Programming
(iv) Backtracking

Search Google Ask AI

Similar questions

Design and Analysis of Algorithms In which algorithmic strategy are problems systematically divided into smaller subproblems until the solution to the original problem is found? (i) Brute-force (ii) Greedy (iii) Dynamic programming (iv) Backtracking20232m Design & Analysis of AlgorithmsIf a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called: - (i) dynamic programming - (ii) greedy - (iii) divide and conquer - (iv) recursion20222m Design and Analysis of Algorithms Differentiate between divide & conquer, greedy method and dynamic programming with suitable examples.20227m Design & Analysis of AlgorithmsWrite short notes on: Divide-and-Conquer vs Dynamic programming20237m

PreviousThe recurrence T(n) = T(n/2) + 1 has a time complexity of: (i) O(n) (ii) O(\log n) (iii) O(n \log n) (iv) O(n^2)NextIn DFS traversal of a graph, which data structure is used to keep track of visited nodes? (i) Queue (ii) Stack (iii) Priority Queue (iv) Heap