Match List I with List II
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A-IV, B-I, C-II, D-III
Explanation
8-queens uses backtracking; closest pair of points uses divide and conquer; string edit distance uses dynamic programming; the (fractional) knapsack problem uses a greedy method.
More Data Structures and Algorithms questions
- What is the maximum value of items you can carry if maximum weight allowed is 25 with a fractional knapsack?
- If new item is added to the list, total items is 8 and capacity is 25 , then the best-case time of fractional knapsack for this case is ___…
- Which of the following statements is correct for a knapsack?
- How many different binary trees are possible with ' n ' nodes?
- Let n be a positive integer and f(n) = 0 if n = 1, and f(n) = f(⌊n/2⌋) + 1 if n > 1. What is f(25), and what does the function compute?
- Given the FFT we can have ______ time procedure for multiplying two polynomials A(x) Q and B(x) of degree bound n where input and output re…