Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following contains the return information of the stack?

Which of the following contains the return information of the stack? Correct Answer frame

The stack contains certain frames which are used to store the return information of the stack and thus the frame need to be removed by adjusting the stack pointer accordingly. Normally this is done to avoid the memory leakage.

Related Questions

Which of the following statements regarding Stacks is/are True? i) The stack always grows towards higher addresses ii) The stack always grows towards lower addresses iii) The stack has a fixed size iv) The width of the stack is 32 bits
You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).
Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N)? b) S c) S d) S
Two stock options are available for buying. Each offers a variable rate of return of profit over a period of 10 years. For first 4 years one has an incremental rate of return which increases by 2% per year starting from 3% of the investment and stays constant at 8% for the rest of the period. The second one has a constant annual rate of return throughout and give 10% more return after 10 years. What is the annual rate of return on second option?
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root. int height (treeptr n) { if (n == NULL) return -1;   if (n →  left == NULL)        if (n →  right == NULL) return 0;        else return ; \(\boxed{B1}\);     // Box 1 else { h1 = height (n →  left);          if (n → right == NULL) return (1+h1);          else { h2 = height (n → right);          return ; \(\boxed{B2}\)   // Box 2                        }            } } The appropriate expressions for the two boxes B1 and B2 are
Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
Principle: A person is duty bound to act with such reasonable caution as a prudent man would have exercised under such circumstances.
Facts: The defendant 'D', built a hay stack near the boundary of his land which bordered the plaintiffs land. He had been warned several times by many in the vicinity over a period of five weeks that the manner in which he built the hay stack was dangerous. The defendant's hay stack had been built with a precautionary "chimney" to prevent the hay from spontaneously igniting, but one day it caught fire. Consequently, the hay ignited and spread to the plaintiffs land, burning down two of the plaintiffs cottages.
Is 'D' liable?
Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code. push(x)                 A[pos] ← x                 pos ← pos – 1 end push pop( )                 pos ← pos + 1                 return A[pos] end pop Which of the following will initialize an empty stack with capacity N for the above implementation?
Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.