Stack Data Structure
Download as PPTX, PDF1 like575 views
The document discusses stack data structures. It defines a stack as a linear data structure that follows the LIFO (last in, first out) principle. Elements can only be inserted or removed from one end, called the top. Common stack operations include push to add an element, pop to remove an element, and functions to check if the stack is empty or full. Stacks have many real-world applications like processing function calls and arithmetic expressions.
![Stack
7
if(top >= 10)
{
cout << "Stack Overflow n";
}
else
{
a[++top] = x;
cout << "Element Inserted n";
}
if(top < 0)
{
cout << "Stack Underflow n";
return 0;
}
else
{
int d = a[top--];
return d;
}](https://image.slidesharecdn.com/firstdaapresentation-190220000603/85/Stack-Data-Structure-7-320.jpg)
Stack Data Structure
- 1. STACK DATA STRUCTURE 1 Presented by: Rabin BK BSc.CSIT 4th Semester
- 2. Introduction Linear data structure Stack implementation References 2
- 3. Introduction 3 A data structure is a particular way of organizing data in a computer so that it can be used effectively The idea is to reduce the space and time complexities of different tasks and improve efficiency A data structure is a specialized format for organizing and storing data. The linear and non-linear data structure is the subclassification of the data structure The linear data structure arranges the data into a sequence and follow some sort of order. E.g., Array, queue, stack, linked list, etc. The non-linear data structure does not organize the data in a sequential manner. E.g., Tree and graph.
- 4. Linear data structure 4 The data elements construct a sequence of a linear list. The elements are adjacently attached to each other and in a specified order. It consumes linear memory space, the data elements are required to store in a sequential manner in the memory. It does not make a good utilization of memory and result in memory wastage. The data element are visited sequentially where only a single element can be directly reached. The examples included in the linear data structure are array, stack, queue, linked list, etc.
- 5. Stack 5 Stack is basically a data object The operational semantic (meaning) of stack is LIFO i.e. last in first out It is an ordered list of elements n , such that n>0 in which all insertions and deletions are made at one end called the top. Primary operations defined on a stack: PUSH : add an element at the top of the list. POP : remove the at the top of the list. Also "IsEmpty()" and "IsFull" function, which tests whether a stack is empty or full respectively.
- 6. Stack 6 Example : Practical daily life: a pile of heavy books kept in a vertical box, dishes kept one on top of another In computer world: In processing of subroutine calls and returns; there is an explicit use of stack of return addresses. Also in evaluation of arithmetic expressions, stack is used. Large number of stacks can be expressed using a single one dimensional stack only. Such an array is called a multiple stack array. For all the standard stack operations (push, pop, isEmpty, size), the worst- case run-time complexity can be O(1). Push and pop are also O(1) because they only work with one end of the data structure - the top of the stack.
- 7. Stack 7 if(top >= 10) { cout << "Stack Overflow n"; } else { a[++top] = x; cout << "Element Inserted n"; } if(top < 0) { cout << "Stack Underflow n"; return 0; } else { int d = a[top--]; return d; }
- 8. References • https://www.studytonight.com/data-structures/stack-data-structure • http://pages.cs.wisc.edu/~siff/CS367/Notes/stacks.html • https://cdn-images-1.medium.com/max/800/1*kkK3EZNOzBsuwkDNvSVR9g.gif 8
- 9. Queries 9