Explanation:
num1= print("Enter a number :")
num2 = print("Enter a number :")
sum = num1 + num2
print(sum)
Answer:
<em><u>use</u></em><em><u> </u></em><em><u>the</u></em><em><u> </u></em><em><u>ope</u></em><em><u>ning</u></em><em><u> </u></em><em><u>and</u></em><em><u> </u></em><em><u>cl</u></em><em><u>osing</u></em><em><u> </u></em><em><u>tags</u></em><em><u> </u></em>
<em><u>[</u></em><em><u>Tex]</u></em><em><u> </u></em><em><u>[</u></em><em><u>\</u></em><em><u>t</u></em><em><u>e</u></em><em><u>x</u></em><em><u>]</u></em><em><u> </u></em><em><u>ok</u></em>
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The value stored by a variable can be changed after it is assigned(true).
The value of a variable can be changed after it is assigned, for example:
int a=10;
and we can change the value of variable a in letter program such as:
a=15;
Variables are a name for a spot in the computer's memory (true).
it is true, because the variables value stored in the computer's memory and we can access theses values by their name (variable name). so Variables are a name for a spot in the computer's memory.
Variable names can be words: such as temperature or height (true).
Yes, the variable name can be words such as height, width, temperature etc.
The value stored by a variable cannot be changed after it is assigned (false).
It is noted that the value stored by a variable can be changed after it is assigned. However, it is noted that is some programming language, you can't change the value of static variable.
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
Answer:
The most popular method of robot programming is probably the teach pendant. ... To program the robot, the operator moves it from point-to-point, using the buttons on the pendant to move it around and save each position individually. When the whole program has been learned, the robot can play back the points at full speed.
