In PUSH instruction, after each execution of the instruction, the stack pointer is

In PUSH instruction, after each execution of the instruction, the stack pointer is Correct Answer decremented by 2

The actual current stack-top is always occupied by the previously pushed data. So, the push operation decrements SP by 2 and then stores the two bytes contents of the operand onto the stack.
Bissoy MCQ

Related Questions

The correct statement for a function that takes pointer to a float, a pointer to a pointer to a char and returns a pointer to a pointer to a integer is ____________
The correct statement for a function that takes pointer to a float, a pointer to a pointer to a char and returns a pointer to a pointer to a integer is
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).
In POP instruction, after each execution of the instruction, the stack pointer is
If we push data onto the stack then the stack pointer
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
While executing the PUSH*A instruction, the stack pointer is decremented by
Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?
Consider you have a stack whose elements in it are as follows. 5 4 3 2 << top Where the top element is 2. You need to get the following stack 6 5 4 3 2 << top The operations that needed to be performed are (You can perform only push and pop):
As the storing of data words onto the stack is increased, the stack pointer is