Match List I with List II
| List I | List II |
|---|---|
| A. Linear Program | I. Prim's Algorithm |
| B. Predicate Logic | II. In order |
| C. Tree Traversal | III. Simplex Algorithm |
| D. Minimum Spanning Tree Problem | IV. First order logic |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. A-III; B-IV; C-II; D-I
Explanation
Linear programs are solved by the simplex method (III). Predicate logic is first-order logic (IV). Inorder is a tree traversal (II). Prim's algorithm solves the MST problem (I).More Data Structures and Algorithms questions
- Match List I with List IIList I List II A. 8-Queens problem I. Divide and conquer B. Closest pair of points II. Dynamic Programming C. Stri…
- Arrange the following search and sort algorithms in ascending order of their worst-case complexities: A. Merge sort B. Linear search C. Bub…
- Find the optimal solution of the fractional knapsack problem when the maximum capacity is 15.
- What is the maximum value of the items you can carry if the maximum weight allowed is 25 (fractional knapsack)?
- If a new item (P = 5, W = 2) is added, giving 8 items, and the capacity is 25, then the time of fractional knapsack in this case is ______
- The most efficient solution to the fractional knapsack problem with maximum capacity 15 is obtained using ___