Answer:
it’s just a screenie hope it helps
Answer:
A WAN can be one large network or can consist of two or more lans connected together. The Internet is the world's largest wan.
Explanation:
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.
So, this is an answer of your choice. What it is trying to ask is tell us what your dream home, job, husband, and so on. For example: My dream home is a mansion in Mississippi by the beach. My dream job is a doctor. Those are prime examples of a dream home and job. Now your answer shouldn't be the same as mine. Your's should be something different. Unless, you want a mansion in Mississippi by the beach and you would like to be a doctor. In other words it is asking you to tell us what you want you home, lifestyle, job, friends, and possibly your DREAM pet. Hope this helps.
