Answer:
The device responsible for performing the fetch-execute cycle is the CPU.
Explanation:
The fetch execution cycle is the way or method the CPU executes instructions given to it. In this process or cycle, the CPU fetches the instruction, then decodes it, executes it, and stores the information in its database.
The CPU executes one instruction at a time.
Answer:
a. =IF(H4>0,12*$D$5-J4,0)
Explanation:
a. =IF(H4>0,12*$D$5-J4,0)
If( H4>0 is the logical test,
12*$D$5-J4 is [value_if_true]
0 is [value_if_false]
b. Referencing to the above formula in (a), which is the required formula which should be typed in cell K4.
Absolute referencing of cell D5 means that this will not change while extending this formula to the entire column. Whereas, since cell H4 and J4 have relative cell referencing, these will change relatively as we extend the formula to the entire column.
Your answer would be propaganda. sorry if i’m wrong.
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.
