Design and Analysis of Algorithms20825 marksNumerical: Vertex cover, knapsackDP Algorithms
How does 0/1 Knapsack problem differ from fractional one? Find the minimum vertex cover in the following graph. [5+0]
How does 0/1 Knapsack problem differ from fractional one? Find the minimum vertex cover in the following graph. [5+0]
- Mark distribution: [5 + 0] - Part 1 (difference between 0/1 and fractional knapsack): 5 marks - Part 2 (minimum vertex cover of "the following graph"): 0 marks - Missing data: The graph referenced in Part 2 ("the following graph") is NOT included in the question text. No vertex set, no edge lis...