Answer:
void countUp(int num)
{
if(num==0) //base case.
return;
countUp(num-1);//Recursive call.
cout<<num<<" "; //printing the number.
}
for input num=25
Output:-1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Explanation:
I have used recursion to print the numbers the function is in c++ language.In every recursive call we are decreasing num by 1.As the base case is reached.Then it will backtrack from 1 to num and then we are printing while backtracking.
Answer: key escrow
Explanation:
Using key escrow we are able to recover data if passphrase is forgotten. this technique uses a bypass link to get all the keys to the system only if it is an authorized entry.
Answer:
G=(A^3 + B) * 4-c^2
To calculate G if A=3, b=4 and C=5
cobegin
p1: A^3 = 27
P2:C^2 =25
P3: p1 +B =31
P4:P3*4 =124
P5:P4-P2 =99
coend
Explanation:
One operation is performed at a time, and on the basis of priority as we have only one processor.
