0
no answer
Wiki User
∙ 8y 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.
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
Which type of data structure is used in ATM to take the printout of last 5 transactions?
stack data structure.
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 LIFO in Data Structure?
LIFO stands for Last In First Out. Ex: Stack
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.
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 a stack in data structure?
A stack is a linear data structure that follows the Last In, First Out (LIFO) principle, where elements are added and removed from the same end called the top. Elements can only be added or removed from the top of the stack, making it a simple and efficient data structure for storing and accessing data.
Which type of data structure is used in ATM to take the printout of last 5 transactions?
stack data structure.
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.
Which data structure is needed to convert infix notations to post fix notations?
stack is the basic data structure needed to convert infix notation to postfix
The best data structure to check whether an arithmetic expression has balanced parentheses is a?
stack
What is stacks in data structure?
Stack is a data structure which is closed at one end. last in first outhi
What is LIFO in Data Structure?
LIFO stands for Last In First Out. Ex: Stack
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.
Can implement circular lists using stack?
No. A stack is a data structure that allows insertion and removal at the top. A circular list allows insertion and removal anywhere in the list. The two types of data structure are too different to be reasonably implementable in terms of each other.
Data structure algorithms using C?
array,linklist,queue,stack,tree,graph etc...
