Algorithm PYQ GATE CS 2018

Algorithm PYQ GATE CS 2018
GATE CS 2018
Consider the weights and values of items listed below. Note that there is only one unit of each item. The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by Vopt. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by Vgreedy. The value of Vopt -Vgreedy is

Видео Algorithm PYQ GATE CS 2018 канала TechoNexus