0
Which type of data structure is used in ATM to take the printout of last 5 transactions?
Wiki User
∙ 11y ago
stack data structure.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
Who invented data structures?
Data structure is a very basic concept. I don't think it's possible to trace it back to a single person who invented it...
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 is LIFO in Data Structure?
LIFO stands for Last In First Out. Ex: Stack
What is the difference between linked list and Ordinary list?
A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.
How do you implement queue using stack in c plus plus?
A queue in any language is a singly-linked list structure that permits new data to be inserted only at the end of a list while existing data can only be extracted from the beginning of the list. Queues are also known as a first in, first out (FIFO) structure. Unlike a standard singly-linked list, the list maintains a pointer to the last node as well as the first, in order to insert new data and extract existing data in constant time. Variations on the queue include the priority queue which permit data to be weighted, such that data with the greatest priority is promoted to the front of the queue, behind any existing data with the same or higher priority, using an insertion sort technique. Insertion is therefore achieved in linear time rather than constant time, however extraction is always in constant time.
Who invented data structures?
Data structure is a very basic concept. I don't think it's possible to trace it back to a single person who invented it...
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 is stacks in data structure?
Stack is a data structure which is closed at one end. last in first outhi
What is the differences between hierarchical and linear structures.?
Linear structure is the most commonly used structure. Linear items are itemized by a single component. This means that besides for the first or last piece of data, something will come before or after it. In hierarchical structure the data is arranged in a tree like structure with several levels. Every entry is equal or less then the its previous.
What is LIFO in Data Structure?
LIFO stands for Last In First Out. Ex: Stack
Can you provide third semester last 5 years question papers of data structure?
Contact the institute concerned
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.
What data structure the pushand pop?
Push and pop are properties of a stack (also called a LIFO-- Last In, First Out-- queue).
What is the difference between linked list and Ordinary list?
A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.
Difference between a queue and a stack in brief?
In a queue, elements are placed in line; the first to get into the queue is the first to get out (FIFO - first in, first out).A stack is also a structure to store pieces of data, or objects, but the last element to get in will be the first element to get out (LIFO).In a queue, elements are placed in line; the first to get into the queue is the first to get out (FIFO - first in, first out).A stack is also a structure to store pieces of data, or objects, but the last element to get in will be the first element to get out (LIFO).In a queue, elements are placed in line; the first to get into the queue is the first to get out (FIFO - first in, first out).A stack is also a structure to store pieces of data, or objects, but the last element to get in will be the first element to get out (LIFO).In a queue, elements are placed in line; the first to get into the queue is the first to get out (FIFO - first in, first out).A stack is also a structure to store pieces of data, or objects, but the last element to get in will be the first element to get out (LIFO).
When a loop structure is preceded by an initial read what is likely to be the last statement in the loop?
When a loop structure is preceded by an initial read the last statement in the loop is likely to be an 'if not end-of-file'. However, this construct would fail if there were no data in the file to start with, as the loop would be processed one time with no data. End-of-file should be checked at the top of the loop, and boundary conditions such as this one ought to be considered.
Why is the queue data structure called a LIFO?
It isn't! A queue is a FIFO structure, not a LIFO structure. FIFO is an acronym for First-In, First-Out and is analogous with first come, first served (as per a queue of people waiting to be served). LIFO is an acronym for Last-In, First-Out, which is analogous with a stack structure, where the last element added is always placed on top of the stack while the top-most element of the stack is always the first to be removed from the stack.
