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:
A mechanical computer
Explanation:
Created from gears and levers
Answer:
1. Open the form in the standard form view.
2. Put the cursor in the field to use for sorting.
3. Open the Home tab
4. In the Sort & Filter group, click ascending or descending
Explanation:
Took the test :)
Let me re-write the proposition:
p↔q⊕(¬p↔¬r)∧¬q.
Generally, the number of rows in a truth table depends on the number of Variables. Here we have 3 Variables: p,q and r. Each of them can have either the value of 1 or 0, which gives us 2*2*2 possibilities, or 2³, that is 8 possibilities and 8 rows:
p=0, q=0, r=0
p=0, q=0, r=1
p=0, q=1, r=0
p=0, q=1, r=1
p=1, q=0, r=0
p=1, q=0, r=1
p=1, q=1, r=0
p=1, q=1, r=1
