Web-Technologies
November 27, 2023Question 4399 – Data-Interpretation
November 27, 2023Algorithm-Paradigms
| Question 5 |
Match the following typical example problems with suitable algorithm-design paradigms
A: Minimal Spanning Tree
B: Binary Search Algorithm
C: Depth-First Search
D: Optimization
I: Divide and Conquer
II: Greedy Method
III: NLP
IV: Backtracking
| A-II, B-I, C-IV, D-III
| |
| A-III, B-II, C-IV, D-I
| |
| A-III, B-I, C-IV, D-II
| |
| A-IV, B-I, C-II, D-III |
Question 5 Explanation:
A. Minimal spanning tree is a greedy algorithm.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.
Correct Answer: A
Question 5 Explanation:
A. Minimal spanning tree is a greedy algorithm.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.