Answer:
def print_sum(a,b,c):
print(a+b+c)
one = int(input("Enter the 1st number: "))
two = int(input("Enter the 2nd number: "))
three = int(input("Enter the 3rd number: "))
print_sum(one,two,three)
Explanation:
hope this helped :)
Answer:
If one or more of the shared sites go down, then there is a good chance that your site will go down as well.
Explanation:
Shared web hosting is a form of web hosting service whereby more than one websites are placed on a single web server that connects to the internet.
Though it is cheaper, it has various problems. And over time, it has been concluded that the major problem associated with shared web hosting is the security issue.
This implies that "If one or more of the shared sites go down, then there is a good chance that your site will go down as well."
Some other problems associated with Shared web hosting are poor value, less flexibility, none advanced features, slow service, less support.
Answer:
Security Tab is the correct answer.
Explanation:
The Security Tab will enable the users to authorize anyone to use that file or directory.Many clients deleted the security tab because After that nobody can alter the security privileges on the device.
- With the help of the Security tab, we will minimize the ActiveX attacks on Internet Explorer. This option is available in the Internet Options of the dialog box.
- Other options are incorrect because they are not related to a given scenario.
Answer:
The problem domain refers to the support options.
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
