What is stack addressing, Computer Engineering

Assignment Help:

Q. What is Stack Addressing?

In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointer (SP). SP points to the top of stack which means to the memory location where last value was pushed. A stack offers a sort-of indirect addressing and indexed addressing. This isn't a very common addressing technique. The operand is found on top of a stack. In a number of machines top two elements of stack and top of stack pointer is kept in CPU registers whereas the rest of elements may exist in memory. Figure below displays the stack addressing schemes.

775_What is Stack Addressing.png

Figure: Stack Addressing


Related Discussions:- What is stack addressing

Explain deadlock, What is a deadlock? A deadlock is a situation that ca...

What is a deadlock? A deadlock is a situation that can increase when two units, A and B use a shared resource. Assume that unit B cannot complete its task unless unit A complet

Parallelism conditions, Parallelism Conditions As discussed earlier, pa...

Parallelism Conditions As discussed earlier, parallel computing needs that the segments to be implemented in parallel must be free of each other. Thus, before implementing para

C program, Write a program to find the area under the curve y = f(x) betwee...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Explain relative addressing scheme, Q. Explain Relative Addressing Scheme? ...

Q. Explain Relative Addressing Scheme? In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed.

Calculus, i want an assignment on application of integraton and my topc of ...

i want an assignment on application of integraton and my topc of assifment is area under the curve includin solved examples

Ethernet 10 base 2 is an example of which topology, Ethernet 10 Base 2 is a...

Ethernet 10 Base 2 is an example of               network topology. (A)  Bus                                           (B)  Ring (C)  Star

Doubly linked list, A doubly linked list is like a linked list except that ...

A doubly linked list is like a linked list except that each node has a pointer both to the next node in the list and to the previous node in the list. There are also pointers to th

C, Drawbacks of linear arrays

Drawbacks of linear arrays

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