0
A stack in Data structure is a LIFO structure. Last In First Out. Think of it as a stack of books or a stack of trays in a cafeteria line. when you are in a line in a cafeteria you take the tray that is on the top and the worker place new washed ones also on the top. So deletion and insertion all done at one end, it is called the top of the stack. In Computer Programming Stacks are so important and have too many applications such as the evaluation of Mathematical expressions. Also note that a stack is unlike a queue structure. Queue data structure is FIFO. First In First Out as in a bank teller line.
Wiki User
∙ 6y ago
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.
Add your answer:
Earn +20 pts
What are the two method used in data processing systems for organizing data?
The two methods used in data processing systems for organizing data are database systems and file systems. Database systems use structured data models and provide a logical organization of data through tables, allowing for efficient storage, retrieval, and manipulation. File systems, on the other hand, organize data in files and folders, providing a hierarchical structure for storage and access.
Data about data is called what in a database?
"Metadata" defines the structure of the data stored.
What is data intergration?
Data integration is the process of combining data from multiple sources into a unified view. It involves extracting data, transforming it to fit the desired structure, and loading it into a target database or data warehouse. This ensures that data is consistent, accurate, and available for analysis across the organization.
Concept of data independence?
Data independence refers to the ability to make changes to the data storage structure without affecting the applications that use the data. There are two types of data independence: logical data independence, which insulates applications from changes to the logical structure of the data, and physical data independence, which shields applications from changes to the physical storage structure of the data. This concept is a key aspect of database design and helps to promote flexibility, scalability, and maintainability of data systems.
Data maintained about the data within the data warehouse is defined as?
Data about other data is metadata.
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 the resource requirement of stack in a data structure?
no answer
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...
