Answer: True
Explanation:
Subset sum problem and Knapsack problem can be solved using dynamic programming.
In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.
Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.
On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.
Answer:
B but don't be surprised if it is not the answer given. It's just the best of a bunch of poor choices.
Explanation:
This is actually not an easy question to answer. It's one of those answers that has elements of "Some do and Some don't" in them.
A: is not true for painters and it is not necessarily true for C for painters.
D: photographer can pose his subjects. A painter can pose someone, but not always.
C: Answered under A.
I think the answer you are forced to choose is B, but neither one has to do it. Still life painters ( a bowl of fruit, a bouquet of flowers) and photographs pose the subjects carefully and do not want the fruit or flowers to move around.
I'd pick B, but it does not have to be the answer. I just think it is less wrong than the others.
Answer:
B
Explanation:
Hope this helps! Have a great day
Answer:
Its most likely the last one
Explanation:
But like, what kind of quesiton is this?