Answer:
Incomes
Explanation:
Project management has to do with the process of achieving a set goal with the help of a team within a specified time. Most times, the main problem that comes with project management is completing the project within the available constraints.
No project can start up without funds, which in this case is called income and this is the part of the project that determines the overall work.
Out of the following, the only one that I see is not the basic role of a webmaster is replying to customers questions about the web site! Usually they have a specific job for that; like customer service etc. Hopefully that helps.
Answer:
Answered below
Explanation:
//Program is written in Python programming //language.
number_of_trees = int(input ("Enter number of trees purchased: "))
height_of_trees = float(input("Enter height of trees: "))
delivery_status = input("Do you want trees delivered? enter yes or no ")
price_of_two_meters = 20
total_price = number_of_trees * price_of_two_meters
//Invoice
print (number_of_trees)
print(height_of_trees)
print (total_price)
print (delivery_status)
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
