What is this supposed to be?!
Sjsjsjsjsjdhshshshshususs
Answer:
The memory and the processing unit communicate through the Memory Address Register (MAR) and the Memory Data Register (MDR).
Explanation:
Answer:
520
Explanation:
Let's say the x = smallest number of units that must be assembled during the regular hours, and 660-x is the number of units that can be assembled in overtime. Then, the total cost should be smaller than or equal to cost1 *x + cost2*3.75
⇒ (x * 2.65) + ((660 - x) * 3.75) <= 1903
⇒ x * (2.65 - 3.75) + (660 * 3.75) <= 1903
⇒ 1.1 * x >= 2475 - 1903
⇒ 1.1 * x >= 572
⇒ x >= 520
Answer:
See explaination for the program code
Explanation:
The code below
Pseudo-code:
//each item ai is used at most once
isSubsetSum(A[],n,t)//takes array of items of size n, and sum t
{
boolean subset[n+1][t+1];//creating a boolean mtraix
for i=1 to n+1
subset[i][1] = true; //initially setting all first column values as true
for i = 2 to t+1
subset[1][i] = false; //initialy setting all first row values as false
for i=2 to n
{
for j=2 to t
{
if(j<A[i-1])
subset[i][j] = subset[i-1][j];
if (j >= A[i-1])
subset[i][j] = subset[i-1][j] ||
subset[i - 1][j-set[i-1]];
}
}
//returns true if there is a subset with given sum t
//other wise returns false
return subset[n][t];
}
Recurrence relation:
T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times
T(1)=1
solving recurrence:
T(n)=T(n-1)+t
T(n)=T(n-2)+t+t
T(n)=T(n-2)+2t
T(n)=T(n-3)+3t
,,
,
T(n)=T(n-n-1)+(n-1)t
T(n)=T(1)+(n-1)t
T(n)=1+(n-1)t = O(nt)
//so complexity is :O(nt)//where n is number of element, t is given sum
