###### Operating-Systems

October 7, 2023###### Compiler-Design

October 7, 2023# Nielit Scientist-B CS 4-12-2016

Question 7 |

The Knapsack problem belongs to which domain of problems?

Optimization | |

NP complete | |

Linear Solution | |

Sorting |

Question 7 Explanation:

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible

Correct Answer: A

Question 7 Explanation:

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible

Subscribe

Login

0 Comments