What are the problems can stack based management in
recursive calling of functions?
Answer / sriram
in recursive calling of functions the return
addresses,local and global variables of the functions
are pushed into the stack...as recursive calls proceed
deeper and deeper it may lead to stack overflow.....
| Is This Answer Correct ? | 3 Yes | 0 No |
abcD+abcd+aBCd+aBCD then the simplified function is ( Capital letters are copliments of corresponding letters A=compliment of a) [a] a [b] ab [c] abc [d] a(bc)* [e] mone (bc)*=compliment of bc
What are named pipes?
What is cache memory?
What is busy waiting?
How can I tell what devices are connected to my usb?
What is a boot-strap program?
Can chkdsk repair bad sectors?
What is the safest operating system?
How does DMA increase system concurrency? How does it complicate hardware design?
What is the difference between Authoritative restore & Non- Authoritative restore?
Briefly explain thrashing.
What are the thread states?