Answer:
I'm pretty sure its B.
Explanation:
Input: Force is applied to the pedals by the rider's feet then..
Process: the chain and gear system convert the energy to cause...
Output: the rear wheels to turn and make the bike go foward
Answer:
Hello, There!
<h2>Your Question↓</h2>
What is the function of ROM?
<h2>Answer↓</h2>
Allows parts of the computer to communicate is the Correct Answer.
Explanation:
<h2>Now you May Ask What does it do or How it works↓</h2>
- ⇒ROM provides the necessary instructions for communication between various hardware components.
- ⇒ it is essential for the storage and operation of the BIOS, but it can also be used for basic data management, to hold software for basic processes of utilities.
Tip: Wanna know how to earn points back for asking your Question?
If you do it's easy just when two people answer your question whichever answer you think is the best click the crown on the side to get 25% of your points back! :D
Therefore, I hope this helps!
Answer: WebMD
WebMD, with the URL https://www.webmd.com, provides credible health and medical information on the web.
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.