Problem:
5. Choose from any value objects which lead to a trip in a backpack
limited capacity.
Example # 1
Algorithm:
1. Home
2. Declare the constants and variables (c, Ipod = 500, Lap = 2000, Cell = 500, Dictionary = 800, = 1000 Shoes, Clothing = 3000, Jewelry = 1000, USB = 200 = 3000 recorder, TV = 5000, Xbox = 3000)
3. Ask d according to function (d = sum of items n)
4. Asiganar d (Xbox, Ipod, Cell)
5. Evaluate condition (d <=6000)
6. Print (True)
7.
End
Example # 2
Algorithm:
1 . Home
2. Declare the constants and variables (c, Ipod = 500, Lap = 2000, Cell = 500, Dictionary = 800, = 1000 Shoes, Clothing = 3000, Jewelry = 1000, USB = 200, Label = 3000, TV = 5000, Xbox = 3000)
3. request according to the function d (d = sum of n items)
4. Asiganar d (TV, Xbox, Clothing, USB, Lap, Footwear)
5. Evaluate condition (d <=6000)
6. Print (False)
7. Assign d again (clothing, Lap)
8. Evaluate condition (d <=6000)
9. Print (true)
10.
False
* These videos are explained step by step flow charts.
Presentation