Spell-check feature is the one that auto corrects any misspelled words
Answer:
Quick analysis tool.
Explanation:
Excel is a spreadsheet application package found in the Microsoft office suite. it's environment on the display screen is called a worksheet and a collection of the worksheets is called a workbook. The excel packet is used for data analysis and interpretation and presentation.
When a group of cells in a worksheet is selected, a small tool kit appears that the lower right corner, it is known as a quick analysis tool. It is use for easy and fast analysis and formatting of that selected group.
Answer:
C. Since he was hungry, she had a snack
Explanation:
So, you can say, " Claire is princes." In this "Claire happens to be the subject, " and Princes is the object. And apart from this a complete sentence must be enough to put forward a complete task. Now in C. we see complete thought is shared. Whereas in no other sentence complete thought has been revealed, and they are incomplete. And hence, the correct option is C.
Answer:
numbers = 1:1:100;
for num=numbers
remainder3 = rem(num,3);
remainder5 = rem(num,5);
if remainder3==0
disp("Yee")
else
if remainder3 == 0 && remainder5 == 0
disp ("Yee-Haw")
else
if remainder5==0
disp("Haw")
else
disp("Not a multiple of 5 or 4")
end
end
end
end
Explanation:
- Initialize the numbers variable from 1 to 100.
- Loop through the all the numbers and find their remainders.
- Check if a number is multiple of 5, 3 or both and display the message accordingly.
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find 
, we need to compute 
and 
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and 
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
