Answer:
Hello! The answer to your question is function I had the same question and got it right!
Explanation:
Hope this helped:)
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:First of all, to work safely at the internet you should avoid any not secure page, and if you can’t do that, avoid entering stuff such as credit cards or passwords on this sites. Now, to work safely it’s recomendable to have a VPN(virtual private network), that hides your IP direction.
Explanation:
The words, the computer is the future, has 64 bits.Modern computer has
two types of processors which include:
<h3>Bits</h3>
This is referred to as the smallest unit of data which is used in a computer.
The 32 bit computer are the old types which have a smaller processor and is
relatively slow.
The 64 bit computer on the other hand are the modern types with large
processors and are relatively fast.
Read more about Computer here brainly.com/question/13380788