How is recursion handled internally, Computer Engineering

Assignment Help:

How is recursion handled internally?

Internally, every recursive call to a function requires storing the intermediate values of the parameters and local variables in a run time stack. The common algorithm for any recursive procedure having the following steps:

 1. Save the parameters, local variables and return address.

 2. If the base criterion has been arrived, then perform the final computation and go to step 3, or else perform the partial computation and go to step 1 with condensed parameter values (initiate a recursive call).

 3. Restore the most newly saved parameters, local variables and return address. Go to this return address.

 


Related Discussions:- How is recursion handled internally

Self knowledge - characteristics of an experts system, An experts system ...

An experts system has knowledge that lets it reason about its own operations plus a structure that simplifies this reasoning process. For example if an expert system

Illustration of cache size of a system, Q. Illustration of cache size of a ...

Q. Illustration of cache size of a system? Cache Size: Cache memory is very costly as compared to main memory and therefore its size is generally kept very small.  It has bee

Determine about the security methods, Determine about the Security methods ...

Determine about the Security methods Security methods also protect information from accidental or intentional modification, manipulation or destruction. Most security experts o

What is graceful degradation, What is graceful degradation? In multipro...

What is graceful degradation? In multiprocessor systems, failure of one processor will not halt the system, but only slow it down by sharing the work of failure system by other

Explain macros and macro processors, System Software 1. Explain MASM? E...

System Software 1. Explain MASM? Explain its features. 2. What is the significance of Lexical analysis and Syntax analysis? 3. Explain macros and macro processors? Explai

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

State the approaches to organizing stored program control, Determine the ap...

Determine the approaches to organizing stored program control There are 2 approaches to organizing stored program control: 1.  Centralized: In this control, all control equi

State some of the uses append query, Some of the uses of append query are a...

Some of the uses of append query are as follows ? You will save time by appending data to an existing table rather than manual update. ? Appending files based on particular

Parallel computer architecture , Parallel Computer Architecture Intr...

Parallel Computer Architecture Introduction We have talked about the classification of parallel computers and their interconnection networks in that order in units 2 and

Posix threads and mutex, The objective of this practical assignment is to u...

The objective of this practical assignment is to use the POSIX environment to write a program that simulates the supply and demand between three processes: warehouse, factory and r

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd