Embedded Files
Target
10.2
By 2030, empower and promote the social, economic and political inclusion of all, irrespective of age, sex, disability, race, ethnicity, origin, religion or economic or other status
Target
10.3
Ensure equal opportunity and reduce inequalities of outcome, including by eliminating discriminatory laws, policies and practices and promoting appropriate legislation, policies and action in this regard
Target
10.7
Facilitate orderly, safe, regular and responsible migration and mobility of people, including through the implementation of planned and well-managed migration policies
Task: Luisa and Ali have been friends since they are little. They agreed to go rafting and they are packing their backpacks. Neither one of them wants the other one to carry more weight so they decided to equaly divide all items into two backpacks, each backpack weighs no more than 1.5 kg.
They want to pack:
2x water bottles – each bottle weighs 500g
2x sandwich – each one weighs 250g
2x spare pairs of socks – each pair weighs 200g
1x cookies – weighs 300g
1x inflatable travel pillow – weighs 200g
1x portable cell phone charger – weighs 325g
1x headphones – weighs 50g
1x hygienic tissues – weighs 175g
Each of the friends will pack one sandwich, one water and one pair of socks. Help them divide the rest of the items having in mind that Luisa wants to carry tissues in her backpack. Use arrows to 'send' each item left (to Luisas backpack) or right (to Alis backpack). Eg. if cookies will be carried by Ali, first should be choosen arrow pointing to the right.
Background: The knapsack 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.
Luisa
Ali
1
2
3
4
5
Page updated
Google Sites
Report abuse