How does stack look in function calls? Write a recursive function call, how will the stack look like?
- 1 Answers
- 1084 Views
- Adobe, I also Faced
- E-Mail Answers
Answer Posted / Rahul Pal
In a recursive function call, each new call creates a new frame on the stack. The new frame contains the return address of the current function (which points to the next instruction after the return statement), local variables, and parameters. As the recursion deepens, more frames are pushed onto the stack. If the recursion is too deep, it can cause stack overflow.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the latest version on c++?
draw a flowchart that accepts two numbers and checks if the first is divisible by the second.
How c functions prevents rework and therefore saves the programers time as wel as length of the code ?
sir please send me bpcl previous question papers
Please send ford technologies placement paper 2 my mail id
What character terminates all character array strings a) b) . c) END
daily Routine of father
Can union be self referenced?
Hi friends I have experience of 6 months in website design and maintanence. Now i am looking for other IT jobs.. to switch platform. please post any interview you know in chennai.
