0
Usually not, but it depends on the context, I mean what kind of stack are you talking about. For example in FORTH language word PICK and ROLL could be used.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
Representation of stack data structure in c plus plus?
Stack is an abstract data type that allows you to input and output data in a way that the first data which was placed in the stack will be the last one to get out. We use physical examples of stack in our daily lives such as the stack of dishes or stack of coins where you only add or remove objects from the top of the stack. You can see the implementation in c++ in related links, below.
Explain The merits of using a deque to implement a stack in data structure?
Explain The merits of using a deque to implement a stack in data structure
What is the resource requirement of stack in a data structure?
no answer
What layers on one stack is most likely to be associated with the transmission of data to another stack?
the physical layer
What are the different types of segment register?
The code segment (CS) register is used for access to program code. The data segment (DS) register is used for access to data. The extra segment (ES) register is used for access to data during certain string primitive operations. The stack segment (SS) register is used for access to stack data.Any of these implied uses can be overridden with a segment override prefix opcode.
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
What makes up a stack?
A stack is usually a sequential series of instructions of any reasonable length. Access to a stack can be FIFO(First In First Out), LIFO (Last In First Out) or by access to any point in the stack by use of a pointer.
Representation of stack data structure in c plus plus?
Stack is an abstract data type that allows you to input and output data in a way that the first data which was placed in the stack will be the last one to get out. We use physical examples of stack in our daily lives such as the stack of dishes or stack of coins where you only add or remove objects from the top of the stack. You can see the implementation in c++ in related links, below.
Explain The merits of using a deque to implement a stack in data structure?
Explain The merits of using a deque to implement a stack in data structure
What does it mean that the stack is a LIFO structure?
LIFO stands for Last In First Out. It basically means that the most recent piece of data added to a list, will be the first piece that is taken off. It is often compared to a stack of plates. When you have a plate to add to the the stack, you put it on the top, not in the middle or at the bottom of the stack. If you need a plate you usually take it from the top, not the middle or bottom. So the most recent plate on the top is the first that will be taken off when one is needed.
What is the difference between static and stack data?
Depending on the use , Static data is data that cannot change it is Static so is usually set at the start of the program and cannot change, In the Forth programming language the stack is the work area of memory you place data onto the stack to manipulate it (example Place 2 and 3 onto the stack, execute the + command removes the top 2 items off the stack adds them together and places the result back onto the stack.)
What is the resource requirement of stack in a data structure?
no answer
What is the use of .stack .data in starting lines of 8086 programming?
.STACK reserves bytes in RAM memory for the stack (the place where the processor will keep function calls and parameters)..DATABelow the ".DATA" line you should declare (and optionally define) your variables, so the compiler reserves the corresponding RAM for each of them.Data works differently from stack, as the data segment will keep named values (the variables values) while the stack will not. The stack will grow as needed upto the maximum value defined in the .STACK directive.
What layers on one stack is most likely to be associated with the transmission of data to another stack?
the physical layer
How can you add different type of data in a stack?
stack is a linear data structure in which data item is either inserted or deleted at one end there are mainly two operations performed on stack.they're push poppush:writing a value to the stack is push or moving the stack pointer up to accomodatethe new item. pop:reading a value from stack or moving the stack pointer down.
What is the difference between stack and array?
Briefly, there are two main differences between an array and a stack. Firstly, an array can be multi-dimensional, while a stack is strictly one-dimensional. Secondly, an array allows direct access to any of its elements, whereas with a stack, only the 'top' element is directly accessible; to access other elements of a stack, you must go through them in order, until you get to the one you want. I hope this answered your question. OK?
